Base | Representation |
---|---|
bin | 1001001101001000011111… |
… | …0010111000001111011101 |
3 | 1022211120122022022211000121 |
4 | 2103102013302320033131 |
5 | 2311311230112223401 |
6 | 33305342544154541 |
7 | 2063143203550030 |
oct | 223220762701735 |
9 | 38746568284017 |
10 | 10121221211101 |
11 | 3252427572110 |
12 | 1175688608a51 |
13 | 5855723527c0 |
14 | 26dc26727017 |
15 | 128422223ca1 |
hex | 93487cb83dd |
10121221211101 has 64 divisors (see below), whose sum is σ = 14197121164800. Its totient is φ = 6959369088000.
The previous prime is 10121221211099. The next prime is 10121221211111. The reversal of 10121221211101 is 10111212212101.
It is not a de Polignac number, because 10121221211101 - 21 = 10121221211099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121221211111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1205895 + ... + 4657963.
It is an arithmetic number, because the mean of its divisors is an integer number (221830018200).
Almost surely, 210121221211101 is an apocalyptic number.
10121221211101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10121221211101 is a deficient number, since it is larger than the sum of its proper divisors (4075899953699).
10121221211101 is a wasteful number, since it uses less digits than its factorization.
10121221211101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3452230.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 10121221211101 its reverse (10111212212101), we get a palindrome (20232433423202).
The spelling of 10121221211101 in words is "ten trillion, one hundred twenty-one billion, two hundred twenty-one million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •