Base | Representation |
---|---|
bin | 1001001101001100001000… |
… | …1100100011011011000101 |
3 | 1022211200011121000021021211 |
4 | 2103103002030203123011 |
5 | 2311320231430120401 |
6 | 33310024105011421 |
7 | 2063206402025032 |
oct | 223230214433305 |
9 | 38750147007254 |
10 | 10122201020101 |
11 | 325288a655115 |
12 | 1175900783b71 |
13 | 58569a340641 |
14 | 26dcba8da389 |
15 | 12847d267951 |
hex | 934c23236c5 |
10122201020101 has 8 divisors (see below), whose sum is σ = 10310359372544. Its totient is φ = 9934759462320.
The previous prime is 10122201020093. The next prime is 10122201020161. The reversal of 10122201020101 is 10102010222101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10122201020101 - 23 = 10122201020093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122201020161) 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 7 ways as a sum of consecutive naturals, for example, 179170161 + ... + 179226646.
It is an arithmetic number, because the mean of its divisors is an integer number (1288794921568).
Almost surely, 210122201020101 is an apocalyptic number.
It is an amenable number.
10122201020101 is a deficient number, since it is larger than the sum of its proper divisors (188158352443).
10122201020101 is an equidigital number, since it uses as much as digits as its factorization.
10122201020101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 358397331.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10122201020101 its reverse (10102010222101), we get a palindrome (20224211242202).
The spelling of 10122201020101 in words is "ten trillion, one hundred twenty-two billion, two hundred one million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.245 sec. • engine limits •