Base | Representation |
---|---|
bin | 11011110001000101001101… |
… | …110010000100111000100000 |
3 | 121000101120100102222011012202 |
4 | 123301011031302010320200 |
5 | 112001303441141200000 |
6 | 1111421112030112332 |
7 | 34502613112533665 |
oct | 3361051562047040 |
9 | 530346312864182 |
10 | 122120110100000 |
11 | 35a02936539951 |
12 | 1184384194b6a8 |
13 | 531ab5291711c |
14 | 2222905725a6c |
15 | e1b9570d5dd5 |
hex | 6f114dc84e20 |
122120110100000 has 72 divisors (see below), whose sum is σ = 300510724777956. Its totient is φ = 48848044000000.
The previous prime is 122120110099963. The next prime is 122120110100039. The reversal of 122120110100000 is 1011021221.
It can be written as a sum of positive squares in 6 ways, for example, as 1753495046416 + 120366615053584 = 1324196^2 + 10971172^2 .
It is a super-2 number, since 2×1221201101000002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 610500551 + ... + 610700550.
Almost surely, 2122120110100000 is an apocalyptic number.
122120110100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122120110100000 is an abundant number, since it is smaller than the sum of its proper divisors (178390614677956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122120110100000 is an frugal number, since it uses more digits than its factorization.
122120110100000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1221201136 (or 1221201108 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 122120110100000 its reverse (1011021221), we get a palindrome (122121121121221).
The spelling of 122120110100000 in words is "one hundred twenty-two trillion, one hundred twenty billion, one hundred ten million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •