Base | Representation |
---|---|
bin | 111000110100001101… |
… | …1001001100111100001 |
3 | 102122221011021121211100 |
4 | 1301220123021213201 |
5 | 3444334311011113 |
6 | 132015011505013 |
7 | 11546355442362 |
oct | 1615033114741 |
9 | 378834247740 |
10 | 122011032033 |
11 | 47821057270 |
12 | 1b7912b8169 |
13 | b675a24c57 |
14 | 5c96473b69 |
15 | 32917e6d73 |
hex | 1c686c99e1 |
122011032033 has 96 divisors (see below), whose sum is σ = 203633823744. Its totient is φ = 69718320000.
The previous prime is 122011032019. The next prime is 122011032037. The reversal of 122011032033 is 330230110221.
It is not a de Polignac number, because 122011032033 - 25 = 122011032001 is a prime.
It is a super-2 number, since 2×1220110320332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122011031997 and 122011032015.
It is not an unprimeable number, because it can be changed into a prime (122011032037) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 20028318 + ... + 20034408.
It is an arithmetic number, because the mean of its divisors is an integer number (2121185664).
Almost surely, 2122011032033 is an apocalyptic number.
It is an amenable number.
122011032033 is a deficient number, since it is larger than the sum of its proper divisors (81622791711).
122011032033 is a wasteful number, since it uses less digits than its factorization.
122011032033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6307 (or 6304 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 122011032033 its reverse (330230110221), we get a palindrome (452241142254).
It can be divided in two parts, 1220 and 11032033, that added together give a triangular number (11033253 = T4697).
The spelling of 122011032033 in words is "one hundred twenty-two billion, eleven million, thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •