Base | Representation |
---|---|
bin | 11011111101111010110000… |
… | …011010011001000001111011 |
3 | 121010111220021010002010101222 |
4 | 123331322300122121001323 |
5 | 112110232033140144011 |
6 | 1113334240144102255 |
7 | 34623422000556524 |
oct | 3375726032310173 |
9 | 533456233063358 |
10 | 123002233131131 |
11 | 36212a54a39402 |
12 | 119667a700498b |
13 | 53830a37bb433 |
14 | 22534a878984b |
15 | e34884e5cddb |
hex | 6fdeb069907b |
123002233131131 has 2 divisors, whose sum is σ = 123002233131132. Its totient is φ = 123002233131130.
The previous prime is 123002233130971. The next prime is 123002233131137. The reversal of 123002233131131 is 131131332200321.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 123002233131131 - 218 = 123002232868987 is a prime.
It is a super-2 number, since 2×1230022331311312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 123002233131131.
It is not a weakly prime, because it can be changed into another prime (123002233131137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61501116565565 + 61501116565566.
It is an arithmetic number, because the mean of its divisors is an integer number (61501116565566).
Almost surely, 2123002233131131 is an apocalyptic number.
123002233131131 is a deficient number, since it is larger than the sum of its proper divisors (1).
123002233131131 is an equidigital number, since it uses as much as digits as its factorization.
123002233131131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 123002233131131 its reverse (131131332200321), we get a palindrome (254133565331452).
The spelling of 123002233131131 in words is "one hundred twenty-three trillion, two billion, two hundred thirty-three million, one hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •