Base | Representation |
---|---|
bin | 1001001101000011111100… |
… | …0000010111111110111101 |
3 | 1022211110111012102111002110 |
4 | 2103100333000113332331 |
5 | 2311301230000342341 |
6 | 33305021441444233 |
7 | 2063101014540321 |
oct | 223207700277675 |
9 | 38743435374073 |
10 | 10120000012221 |
11 | 32519601a7340 |
12 | 11753a7640679 |
13 | 585409348308 |
14 | 26db4c479981 |
15 | 12839edec216 |
hex | 9343f017fbd |
10120000012221 has 32 divisors (see below), whose sum is σ = 15051880038528. Its totient is φ = 5995885559040.
The previous prime is 10120000012219. The next prime is 10120000012249. The reversal of 10120000012221 is 12221000002101.
It is not a de Polignac number, because 10120000012221 - 21 = 10120000012219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10120000012197 and 10120000012206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120000002221) 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, 9959866 + ... + 10928811.
It is an arithmetic number, because the mean of its divisors is an integer number (470371251204).
Almost surely, 210120000012221 is an apocalyptic number.
10120000012221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10120000012221 is a deficient number, since it is larger than the sum of its proper divisors (4931880026307).
10120000012221 is a wasteful number, since it uses less digits than its factorization.
10120000012221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20889021.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10120000012221 its reverse (12221000002101), we get a palindrome (22341000014322).
The spelling of 10120000012221 in words is "ten trillion, one hundred twenty billion, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •