Base | Representation |
---|---|
bin | 11011101111010101011101… |
… | …010001111000010110001100 |
3 | 120222222002121111111211122220 |
4 | 123233111131101320112030 |
5 | 111442322211404324322 |
6 | 1111250024405135340 |
7 | 34461134324235120 |
oct | 3357253521702614 |
9 | 528862544454586 |
10 | 122000111011212 |
11 | 35966a581473a5 |
12 | 118245323ba550 |
13 | 530c73a98b745 |
14 | 221aba0579580 |
15 | e1878226055c |
hex | 6ef55d47858c |
122000111011212 has 48 divisors (see below), whose sum is σ = 331471999740672. Its totient is φ = 34199492034240.
The previous prime is 122000111011063. The next prime is 122000111011283. The reversal of 122000111011212 is 212110111000221.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 122000111011191 and 122000111011200.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13701715114 + ... + 13701724017.
It is an arithmetic number, because the mean of its divisors is an integer number (6905666661264).
Almost surely, 2122000111011212 is an apocalyptic number.
122000111011212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
122000111011212 is an abundant number, since it is smaller than the sum of its proper divisors (209471888729460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122000111011212 is a wasteful number, since it uses less digits than its factorization.
122000111011212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27403439198 (or 27403439196 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 122000111011212 its reverse (212110111000221), we get a palindrome (334110222011433).
The spelling of 122000111011212 in words is "one hundred twenty-two trillion, one hundred eleven million, eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •