Base | Representation |
---|---|
bin | 1001010100101100101111… |
… | …0110110110011110101110 |
3 | 1100022000011121011021210011 |
4 | 2111023023312312132232 |
5 | 2320423440300401110 |
6 | 33445201500403434 |
7 | 2105424410220445 |
oct | 225131366663656 |
9 | 40260147137704 |
10 | 10251212122030 |
11 | 32a2572aa3510 |
12 | 119690624657a |
13 | 5948ba394289 |
14 | 276238907d5c |
15 | 12b9ce38e48a |
hex | 952cbdb67ae |
10251212122030 has 32 divisors (see below), whose sum is σ = 20137416529248. Its totient is φ = 3726275788800.
The previous prime is 10251212122007. The next prime is 10251212122061. The reversal of 10251212122030 is 3022121215201.
It is a super-2 number, since 2×102512121220302 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 10251212121992 and 10251212122010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17684851 + ... + 18255310.
It is an arithmetic number, because the mean of its divisors is an integer number (629294266539).
Almost surely, 210251212122030 is an apocalyptic number.
10251212122030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10251212122030 is a deficient number, since it is larger than the sum of its proper divisors (9886204407218).
10251212122030 is a wasteful number, since it uses less digits than its factorization.
10251212122030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35942772.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 10251212122030 its reverse (3022121215201), we get a palindrome (13273333337231).
The spelling of 10251212122030 in words is "ten trillion, two hundred fifty-one billion, two hundred twelve million, one hundred twenty-two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •