Base | Representation |
---|---|
bin | 11011111110010101111010… |
… | …111010000001100101101011 |
3 | 121010121200112211010000112201 |
4 | 123332111322322001211223 |
5 | 112111221301424201011 |
6 | 1113355502304121031 |
7 | 34625503535021146 |
oct | 3376257272014553 |
9 | 533550484100481 |
10 | 123031400225131 |
11 | 36224362006872 |
12 | 11970387006177 |
13 | 5385a7144ba38 |
14 | 2254a7434105d |
15 | e354e08aecc1 |
hex | 6fe57ae8196b |
123031400225131 has 2 divisors, whose sum is σ = 123031400225132. Its totient is φ = 123031400225130.
The previous prime is 123031400225081. The next prime is 123031400225137. The reversal of 123031400225131 is 131522004130321.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 123031400225131 - 243 = 114235307202923 is a prime.
It is a super-2 number, since 2×1230314002251312 (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 123031400225131.
It is not a weakly prime, because it can be changed into another prime (123031400225137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61515700112565 + 61515700112566.
It is an arithmetic number, because the mean of its divisors is an integer number (61515700112566).
Almost surely, 2123031400225131 is an apocalyptic number.
123031400225131 is a deficient number, since it is larger than the sum of its proper divisors (1).
123031400225131 is an equidigital number, since it uses as much as digits as its factorization.
123031400225131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 123031400225131 its reverse (131522004130321), we get a palindrome (254553404355452).
The spelling of 123031400225131 in words is "one hundred twenty-three trillion, thirty-one billion, four hundred million, two hundred twenty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •