Base | Representation |
---|---|
bin | 1011010011111010… |
… | …1111011010011101 |
3 | 21211121102100200202 |
4 | 2310332233122131 |
5 | 22204301033023 |
6 | 1221143233245 |
7 | 135146341511 |
oct | 26476573235 |
9 | 7747370622 |
10 | 3036346013 |
11 | 1318a35778 |
12 | 708a48825 |
13 | 39509bb5c |
14 | 20b388141 |
15 | 12b873128 |
hex | b4faf69d |
3036346013 has 8 divisors (see below), whose sum is σ = 3258996408. Its totient is φ = 2818589184.
The previous prime is 3036346007. The next prime is 3036346021. The reversal of 3036346013 is 3106436303.
It can be written as a sum of positive squares in 4 ways, for example, as 629658649 + 2406687364 = 25093^2 + 49058^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3036346013 - 24 = 3036345997 is a prime.
It is a super-2 number, since 2×30363460132 = 18438794221321992338, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3036346003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1222106 + ... + 1224587.
It is an arithmetic number, because the mean of its divisors is an integer number (407374551).
Almost surely, 23036346013 is an apocalyptic number.
It is an amenable number.
3036346013 is a deficient number, since it is larger than the sum of its proper divisors (222650395).
3036346013 is a wasteful number, since it uses less digits than its factorization.
3036346013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2446783.
The product of its (nonzero) digits is 11664, while the sum is 29.
The square root of 3036346013 is about 55103.0490354209. The cubic root of 3036346013 is about 1448.0506524931.
The spelling of 3036346013 in words is "three billion, thirty-six million, three hundred forty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •