Base | Representation |
---|---|
bin | 11011110000110010100000… |
… | …011000010001111010111111 |
3 | 121000022122111101210122121111 |
4 | 123300302200120101322333 |
5 | 112000441320334310421 |
6 | 1111403550355142451 |
7 | 34501302226224544 |
oct | 3360624030217277 |
9 | 530278441718544 |
10 | 122100021010111 |
11 | 359a53677a0321 |
12 | 1183b975ba4a27 |
13 | 5318ca09488a1 |
14 | 222195b68cbcb |
15 | e1b17d61cee1 |
hex | 6f0ca0611ebf |
122100021010111 has 48 divisors (see below), whose sum is σ = 134702178508800. Its totient is φ = 110360748079296.
The previous prime is 122100021010087. The next prime is 122100021010159. The reversal of 122100021010111 is 111010120001221.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-122100021010111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122100021010091 and 122100021010100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122100021010811) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10257913986 + ... + 10257925888.
It is an arithmetic number, because the mean of its divisors is an integer number (2806295385600).
Almost surely, 2122100021010111 is an apocalyptic number.
122100021010111 is a deficient number, since it is larger than the sum of its proper divisors (12602157498689).
122100021010111 is a wasteful number, since it uses less digits than its factorization.
122100021010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14500 (or 14477 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 122100021010111 its reverse (111010120001221), we get a palindrome (233110141011332).
The spelling of 122100021010111 in words is "one hundred twenty-two trillion, one hundred billion, twenty-one million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •