Base | Representation |
---|---|
bin | 11011101111110011010001… |
… | …111001000111000100000001 |
3 | 121000002011021010001221200111 |
4 | 123233303101321013010001 |
5 | 111443333301322120413 |
6 | 1111312442042551321 |
7 | 34463346666113311 |
oct | 3357632171070401 |
9 | 530064233057614 |
10 | 122032132223233 |
11 | 3597959a2a5991 |
12 | 1182a78a208541 |
13 | 5312771a16b8b |
14 | 221c55b201441 |
15 | e1950853bd3d |
hex | 6efcd1e47101 |
122032132223233 has 32 divisors (see below), whose sum is σ = 130822381704960. Its totient is φ = 113554308215040.
The previous prime is 122032132223191. The next prime is 122032132223347. The reversal of 122032132223233 is 332322231230221.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122032132223233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122032132223195 and 122032132223204.
It is not an unprimeable number, because it can be changed into a prime (122032132223933) 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, 920701635 + ... + 920834167.
It is an arithmetic number, because the mean of its divisors is an integer number (4088199428280).
Almost surely, 2122032132223233 is an apocalyptic number.
It is an amenable number.
122032132223233 is a deficient number, since it is larger than the sum of its proper divisors (8790249481727).
122032132223233 is a wasteful number, since it uses less digits than its factorization.
122032132223233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136329.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 122032132223233 its reverse (332322231230221), we get a palindrome (454354363453454).
The spelling of 122032132223233 in words is "one hundred twenty-two trillion, thirty-two billion, one hundred thirty-two million, two hundred twenty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •