Base | Representation |
---|---|
bin | 11011101111010111011001… |
… | …110110111100001011001001 |
3 | 120222222022000011101101211211 |
4 | 123233113121312330023021 |
5 | 111442341001440213001 |
6 | 1111251012031053121 |
7 | 34461240163555264 |
oct | 3357273166741311 |
9 | 528868004341754 |
10 | 122002201101001 |
11 | 3596792aa26831 |
12 | 11824a163711a1 |
13 | 530c9b19b9870 |
14 | 221ad1bda5cdb |
15 | e188559bb351 |
hex | 6ef5d9dbc2c9 |
122002201101001 has 16 divisors (see below), whose sum is σ = 132010928380800. Its totient is φ = 112082618632320.
The previous prime is 122002201100933. The next prime is 122002201101017. The reversal of 122002201101001 is 100101102200221.
It is a cyclic number.
It is not a de Polignac number, because 122002201101001 - 213 = 122002201092809 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122002201101031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 536397900 + ... + 536625298.
It is an arithmetic number, because the mean of its divisors is an integer number (8250683023800).
Almost surely, 2122002201101001 is an apocalyptic number.
It is an amenable number.
122002201101001 is a deficient number, since it is larger than the sum of its proper divisors (10008727279799).
122002201101001 is a wasteful number, since it uses less digits than its factorization.
122002201101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423216.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 122002201101001 its reverse (100101102200221), we get a palindrome (222103303301222).
The spelling of 122002201101001 in words is "one hundred twenty-two trillion, two billion, two hundred one million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •