Base | Representation |
---|---|
bin | 1001001101000011111100… |
… | …1011110110100110100101 |
3 | 1022211110111102002100122220 |
4 | 2103100333023312212211 |
5 | 2311301231233134341 |
6 | 33305022030142553 |
7 | 2063101052242032 |
oct | 223207713664645 |
9 | 38743442070586 |
10 | 10120003021221 |
11 | 3251961972015 |
12 | 11753a8651a59 |
13 | 585409b5caa2 |
14 | 26db4ca20389 |
15 | 1283a02e3a66 |
hex | 9343f2f69a5 |
10120003021221 has 32 divisors (see below), whose sum is σ = 14610314167680. Its totient is φ = 6209814067200.
The previous prime is 10120003021201. The next prime is 10120003021231. The reversal of 10120003021221 is 12212030002101.
It is not a de Polignac number, because 10120003021221 - 26 = 10120003021157 is a prime.
It is a super-2 number, since 2×101200030212212 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10120003021221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120003021201) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8420890 + ... + 9547323.
It is an arithmetic number, because the mean of its divisors is an integer number (456572317740).
Almost surely, 210120003021221 is an apocalyptic number.
It is an amenable number.
10120003021221 is a deficient number, since it is larger than the sum of its proper divisors (4490311146459).
10120003021221 is a wasteful number, since it uses less digits than its factorization.
10120003021221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17968517.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10120003021221 its reverse (12212030002101), we get a palindrome (22332033023322).
The spelling of 10120003021221 in words is "ten trillion, one hundred twenty billion, three million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •