Base | Representation |
---|---|
bin | 11011110001000110001111… |
… | …011010100001000010000101 |
3 | 121000101200012011220212000201 |
4 | 123301012033122201002011 |
5 | 112001313220033020401 |
6 | 1111421413203010501 |
7 | 34502652313103452 |
oct | 3361061732410205 |
9 | 530350164825021 |
10 | 122121211220101 |
11 | 35a03351049765 |
12 | 11843aaa669a31 |
13 | 531ac99a9a892 |
14 | 22229aba76829 |
15 | e1b9bdaddb01 |
hex | 6f118f6a1085 |
122121211220101 has 32 divisors (see below), whose sum is σ = 133476433488000. Its totient is φ = 111289034723328.
The previous prime is 122121211220081. The next prime is 122121211220123. The reversal of 122121211220101 is 101022112121221.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 122121211220101 - 29 = 122121211219589 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122121211220191) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 219315826 + ... + 219871948.
It is an arithmetic number, because the mean of its divisors is an integer number (4171138546500).
Almost surely, 2122121211220101 is an apocalyptic number.
It is an amenable number.
122121211220101 is a deficient number, since it is larger than the sum of its proper divisors (11355222267899).
122121211220101 is a wasteful number, since it uses less digits than its factorization.
122121211220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 557653.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 122121211220101 its reverse (101022112121221), we get a palindrome (223143323341322).
The spelling of 122121211220101 in words is "one hundred twenty-two trillion, one hundred twenty-one billion, two hundred eleven million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •