Base | Representation |
---|---|
bin | 10011001100001000… |
… | …01100111001001100 |
3 | 222120222121200020120 |
4 | 21212010030321030 |
5 | 132044342441022 |
6 | 4422142144540 |
7 | 513205131036 |
oct | 114604147114 |
9 | 28528550216 |
10 | 10302312012 |
11 | 4407428553 |
12 | 1bb6282150 |
13 | c82517715 |
14 | 6da378c56 |
15 | 4046c6d5c |
hex | 26610ce4c |
10302312012 has 48 divisors (see below), whose sum is σ = 25409932800. Its totient is φ = 3239732160.
The previous prime is 10302312011. The next prime is 10302312049. The reversal of 10302312012 is 21021320301.
It is a super-3 number, since 3×103023120123 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 10302311982 and 10302312000.
It is not an unprimeable number, because it can be changed into a prime (10302312011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40039 + ... + 149022.
It is an arithmetic number, because the mean of its divisors is an integer number (529373600).
Almost surely, 210302312012 is an apocalyptic number.
10302312012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10302312012 is an abundant number, since it is smaller than the sum of its proper divisors (15107620788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10302312012 is a wasteful number, since it uses less digits than its factorization.
10302312012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 189326 (or 189324 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 10302312012 its reverse (21021320301), we get a palindrome (31323632313).
The spelling of 10302312012 in words is "ten billion, three hundred two million, three hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •