Base | Representation |
---|---|
bin | 1001001101001000011111… |
… | …0010111000001101111001 |
3 | 1022211120122022022210212220 |
4 | 2103102013302320031321 |
5 | 2311311230112223001 |
6 | 33305342544154253 |
7 | 2063143203546525 |
oct | 223220762701571 |
9 | 38746568283786 |
10 | 10121221211001 |
11 | 325242757202a |
12 | 1175688608989 |
13 | 585572352744 |
14 | 26dc26726d85 |
15 | 128422223c36 |
hex | 93487cb8379 |
10121221211001 has 8 divisors (see below), whose sum is σ = 13496831010720. Its totient is φ = 6746546109312.
The previous prime is 10121221210993. The next prime is 10121221211027. The reversal of 10121221211001 is 10011212212101.
It is a happy number.
10121221211001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10121221211001 - 23 = 10121221210993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10121221211051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 233649240 + ... + 233692553.
It is an arithmetic number, because the mean of its divisors is an integer number (1687103876340).
Almost surely, 210121221211001 is an apocalyptic number.
It is an amenable number.
10121221211001 is a deficient number, since it is larger than the sum of its proper divisors (3375609799719).
10121221211001 is an equidigital number, since it uses as much as digits as its factorization.
10121221211001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 467349015.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10121221211001 its reverse (10011212212101), we get a palindrome (20132433423102).
The spelling of 10121221211001 in words is "ten trillion, one hundred twenty-one billion, two hundred twenty-one million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •