Base | Representation |
---|---|
bin | 1001010111101010011011… |
… | …0111110101100110011010 |
3 | 1100110212121020110001001210 |
4 | 2111322212313311212122 |
5 | 2322242231043344010 |
6 | 33524422253523550 |
7 | 2112206262420534 |
oct | 225724667654632 |
9 | 40425536401053 |
10 | 10302131231130 |
11 | 331212255a862 |
12 | 11a4756aa35b6 |
13 | 59964368b42b |
14 | 2788a932a854 |
15 | 12ceae787b20 |
hex | 95ea6df599a |
10302131231130 has 64 divisors (see below), whose sum is σ = 24741963734400. Its totient is φ = 2745363584256.
The previous prime is 10302131231129. The next prime is 10302131231153. The reversal of 10302131231130 is 3113213120301.
It is a happy number.
It is a super-2 number, since 2×103021312311302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10302131231097 and 10302131231106.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 286049004 + ... + 286085016.
It is an arithmetic number, because the mean of its divisors is an integer number (386593183350).
Almost surely, 210302131231130 is an apocalyptic number.
10302131231130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10302131231130 is an abundant number, since it is smaller than the sum of its proper divisors (14439832503270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10302131231130 is a wasteful number, since it uses less digits than its factorization.
10302131231130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42255.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10302131231130 its reverse (3113213120301), we get a palindrome (13415344351431).
The spelling of 10302131231130 in words is "ten trillion, three hundred two billion, one hundred thirty-one million, two hundred thirty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •