Base | Representation |
---|---|
bin | 1001001011111101100111… |
… | …0011010001110010111001 |
3 | 1022202122202120111211011111 |
4 | 2102333121303101302321 |
5 | 2310444044241223001 |
6 | 33252220321000321 |
7 | 2061532140064063 |
oct | 222773163216271 |
9 | 38678676454144 |
10 | 10101122211001 |
11 | 3244953174928 |
12 | 11717b94830a1 |
13 | 5836bb2c4533 |
14 | 26cc7b230733 |
15 | 127b4794e851 |
hex | 92fd9cd1cb9 |
10101122211001 has 8 divisors (see below), whose sum is σ = 10240002123624. Its totient is φ = 9962256038400.
The previous prime is 10101122210999. The next prime is 10101122211073. The reversal of 10101122211001 is 10011222110101.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 320866735401 + 9780255475600 = 566451^2 + 3127340^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10101122211001 - 21 = 10101122210999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10101122211601) 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, 1950196 + ... + 4899541.
It is an arithmetic number, because the mean of its divisors is an integer number (1280000265453).
Almost surely, 210101122211001 is an apocalyptic number.
It is an amenable number.
10101122211001 is a deficient number, since it is larger than the sum of its proper divisors (138879912623).
10101122211001 is an equidigital number, since it uses as much as digits as its factorization.
10101122211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6870011.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10101122211001 its reverse (10011222110101), we get a palindrome (20112344321102).
The spelling of 10101122211001 in words is "ten trillion, one hundred one billion, one hundred twenty-two million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •