Base | Representation |
---|---|
bin | 1001010001111011011101… |
… | …0001011100001000100010 |
3 | 1100010110022222012012212112 |
4 | 2110132313101130020202 |
5 | 2314134004231131320 |
6 | 33411251305555322 |
7 | 2102121161033555 |
oct | 224366721341042 |
9 | 40113288165775 |
10 | 10203622130210 |
11 | 3284371759263 |
12 | 11896444a5b42 |
13 | 590274a056c2 |
14 | 273c022c069c |
15 | 12a64639aec5 |
hex | 947b745c222 |
10203622130210 has 8 divisors (see below), whose sum is σ = 18366519834396. Its totient is φ = 4081448852080.
The previous prime is 10203622130203. The next prime is 10203622130213. The reversal of 10203622130210 is 1203122630201.
It can be written as a sum of positive squares in 2 ways, for example, as 9907240970929 + 296381159281 = 3147577^2 + 544409^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×102036221302102 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10203622130213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 510181106501 + ... + 510181106520.
Almost surely, 210203622130210 is an apocalyptic number.
10203622130210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10203622130210 is a deficient number, since it is larger than the sum of its proper divisors (8162897704186).
10203622130210 is a wasteful number, since it uses less digits than its factorization.
10203622130210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1020362213028.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 10203622130210 its reverse (1203122630201), we get a palindrome (11406744760411).
The spelling of 10203622130210 in words is "ten trillion, two hundred three billion, six hundred twenty-two million, one hundred thirty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •