Base | Representation |
---|---|
bin | 11011101111010110010011… |
… | …011101011001101101010111 |
3 | 120222222011221211221022101110 |
4 | 123233112103131121231113 |
5 | 111442331042110013421 |
6 | 1111250254520030103 |
7 | 34461166002435336 |
oct | 3357262335315527 |
9 | 528864854838343 |
10 | 122001020001111 |
11 | 35967384259a19 |
12 | 11824746902333 |
13 | 530c8540b1ca4 |
14 | 221ac49195d1d |
15 | e187d6e65a76 |
hex | 6ef593759b57 |
122001020001111 has 4 divisors (see below), whose sum is σ = 162668026668152. Its totient is φ = 81334013334072.
The previous prime is 122001020001073. The next prime is 122001020001137. The reversal of 122001020001111 is 111100020100221.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 122001020001111 - 27 = 122001020000983 is a prime.
It is a super-2 number, since 2×1220010200011112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122001020001911) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20333503333516 + ... + 20333503333521.
It is an arithmetic number, because the mean of its divisors is an integer number (40667006667038).
Almost surely, 2122001020001111 is an apocalyptic number.
122001020001111 is a deficient number, since it is larger than the sum of its proper divisors (40667006667041).
122001020001111 is an equidigital number, since it uses as much as digits as its factorization.
122001020001111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40667006667040.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 122001020001111 its reverse (111100020100221), we get a palindrome (233101040101332).
The spelling of 122001020001111 in words is "one hundred twenty-two trillion, one billion, twenty million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •