Base | Representation |
---|---|
bin | 10110010111101111… |
… | …01010101000111101 |
3 | 1011000000111120001111 |
4 | 23023313222220331 |
5 | 144044114131023 |
6 | 5303434242021 |
7 | 603424611523 |
oct | 131367525075 |
9 | 34000446044 |
10 | 12010302013 |
11 | 5103558736 |
12 | 23b2286311 |
13 | 11953309a8 |
14 | 81d140313 |
15 | 4a460800d |
hex | 2cbdeaa3d |
12010302013 has 8 divisors (see below), whose sum is σ = 12301398560. Its totient is φ = 11722494960.
The previous prime is 12010302011. The next prime is 12010302037. The reversal of 12010302013 is 31020301021.
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 12010302013 - 21 = 12010302011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12010301984 and 12010302002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12010302011) 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, 814983 + ... + 829588.
It is an arithmetic number, because the mean of its divisors is an integer number (1537674820).
Almost surely, 212010302013 is an apocalyptic number.
It is an amenable number.
12010302013 is a deficient number, since it is larger than the sum of its proper divisors (291096547).
12010302013 is a wasteful number, since it uses less digits than its factorization.
12010302013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1644747.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 12010302013 its reverse (31020301021), we get a palindrome (43030603034).
The spelling of 12010302013 in words is "twelve billion, ten million, three hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •