Base | Representation |
---|---|
bin | 1001001101001000000111… |
… | …0101011100010110100001 |
3 | 1022211120101100011202000112 |
4 | 2103102001311130112201 |
5 | 2311311024013020001 |
6 | 33305325013101105 |
7 | 2063140550622551 |
oct | 223220165342641 |
9 | 38746340152015 |
10 | 10121121220001 |
11 | 3252386087340 |
12 | 117565b027795 |
13 | 58555771307c |
14 | 26dc17339161 |
15 | 128418571cbb |
hex | 93481d5c5a1 |
10121121220001 has 16 divisors (see below), whose sum is σ = 11074520099328. Its totient is φ = 9173299766400.
The previous prime is 10121121219997. The next prime is 10121121220033. The reversal of 10121121220001 is 10002212112101.
It is not a de Polignac number, because 10121121220001 - 22 = 10121121219997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10121121220801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6559421 + ... + 7954133.
It is an arithmetic number, because the mean of its divisors is an integer number (692157506208).
Almost surely, 210121121220001 is an apocalyptic number.
10121121220001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10121121220001 is a deficient number, since it is larger than the sum of its proper divisors (953398879327).
10121121220001 is a wasteful number, since it uses less digits than its factorization.
10121121220001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1396712.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10121121220001 its reverse (10002212112101), we get a palindrome (20123333332102).
The spelling of 10121121220001 in words is "ten trillion, one hundred twenty-one billion, one hundred twenty-one million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •