Base | Representation |
---|---|
bin | 10011001100000110… |
… | …00001100001110000 |
3 | 222120222000222210020 |
4 | 21212003001201300 |
5 | 132044303101222 |
6 | 4422131403440 |
7 | 513202404036 |
oct | 114603014160 |
9 | 28528028706 |
10 | 10302003312 |
11 | 4407237627 |
12 | 1bb6153580 |
13 | c8243a063 |
14 | 6da2d8556 |
15 | 40466565c |
hex | 2660c1870 |
10302003312 has 40 divisors (see below), whose sum is σ = 26717095056. Its totient is φ = 3420635136.
The previous prime is 10302003307. The next prime is 10302003317. The reversal of 10302003312 is 21330020301.
It is an interprime number because it is at equal distance from previous prime (10302003307) and next prime (10302003317).
It is a super-2 number, since 2×103020033122 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10302003291 and 10302003300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10302003317) 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, 405223 + ... + 429894.
Almost surely, 210302003312 is an apocalyptic number.
10302003312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10302003312 is an abundant number, since it is smaller than the sum of its proper divisors (16415091744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10302003312 is a wasteful number, since it uses less digits than its factorization.
10302003312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 835385 (or 835379 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 10302003312 its reverse (21330020301), we get a palindrome (31632023613).
The spelling of 10302003312 in words is "ten billion, three hundred two million, three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •