Base | Representation |
---|---|
bin | 11011101111010110100000… |
… | …001010011011110111010011 |
3 | 120222222012111200222112101112 |
4 | 123233112200022123313103 |
5 | 111442332011140224021 |
6 | 1111250332012123535 |
7 | 34461204201145211 |
oct | 3357264012336723 |
9 | 528865450875345 |
10 | 122001233133011 |
11 | 359674835a1091 |
12 | 118247a61665ab |
13 | 530c8892b653b |
14 | 221ac695d5cb1 |
15 | e187eaa15d5b |
hex | 6ef5a029bdd3 |
122001233133011 has 4 divisors (see below), whose sum is σ = 124069050643800. Its totient is φ = 119933415622224.
The previous prime is 122001233132969. The next prime is 122001233133047. The reversal of 122001233133011 is 110331332100221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 122001233133011 - 238 = 121726355226067 is a prime.
It is a super-2 number, since 2×1220012331330112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122001233133511) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1033908755306 + ... + 1033908755423.
It is an arithmetic number, because the mean of its divisors is an integer number (31017262660950).
Almost surely, 2122001233133011 is an apocalyptic number.
122001233133011 is a deficient number, since it is larger than the sum of its proper divisors (2067817510789).
122001233133011 is an equidigital number, since it uses as much as digits as its factorization.
122001233133011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2067817510788.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 122001233133011 its reverse (110331332100221), we get a palindrome (232332565233232).
The spelling of 122001233133011 in words is "one hundred twenty-two trillion, one billion, two hundred thirty-three million, one hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •