Base | Representation |
---|---|
bin | 11011101111011111100111… |
… | …100000011100101000000111 |
3 | 121000000010202202201220201222 |
4 | 123233133213200130220013 |
5 | 111443012032111121411 |
6 | 1111255031103110555 |
7 | 34462001550260126 |
oct | 3357374740345007 |
9 | 530003682656658 |
10 | 122011020020231 |
11 | 35970645a87331 |
12 | 118266778a245b |
13 | 5310788aa8074 |
14 | 221b517321abd |
15 | e18bbed294db |
hex | 6ef7e781ca07 |
122011020020231 has 4 divisors (see below), whose sum is σ = 122011199244912. Its totient is φ = 122010840795552.
The previous prime is 122011020020137. The next prime is 122011020020237. The reversal of 122011020020231 is 132020020110221.
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 122011020020231 - 234 = 121993840151047 is a prime.
It is a super-2 number, since 2×1220110200202312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122011020020237) 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, 88587275 + ... + 89954028.
It is an arithmetic number, because the mean of its divisors is an integer number (30502799811228).
Almost surely, 2122011020020231 is an apocalyptic number.
122011020020231 is a deficient number, since it is larger than the sum of its proper divisors (179224681).
122011020020231 is an equidigital number, since it uses as much as digits as its factorization.
122011020020231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179224680.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 122011020020231 its reverse (132020020110221), we get a palindrome (254031040130452).
The spelling of 122011020020231 in words is "one hundred twenty-two trillion, eleven billion, twenty million, twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •