Base | Representation |
---|---|
bin | 110100110000000011110001… |
… | …111010111010011010110111 |
3 | 1010102110002011102211102210221 |
4 | 310300003301322322122313 |
5 | 220402101033111312211 |
6 | 2141231443232555211 |
7 | 66603343234131466 |
oct | 6460036172723267 |
9 | 1112402142742727 |
10 | 232001012213431 |
11 | 67a1709316010a |
12 | 2202b4256b2b07 |
13 | 9c5b7a8887846 |
14 | 4140ca206a9dd |
15 | 1bc4d2ab3ac71 |
hex | d300f1eba6b7 |
232001012213431 has 2 divisors, whose sum is σ = 232001012213432. Its totient is φ = 232001012213430.
The previous prime is 232001012213263. The next prime is 232001012213441. The reversal of 232001012213431 is 134312210100232.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 232001012213431 - 221 = 232001010116279 is a prime.
It is a super-2 number, since 2×2320010122134312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 232001012213396 and 232001012213405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232001012213441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116000506106715 + 116000506106716.
It is an arithmetic number, because the mean of its divisors is an integer number (116000506106716).
Almost surely, 2232001012213431 is an apocalyptic number.
232001012213431 is a deficient number, since it is larger than the sum of its proper divisors (1).
232001012213431 is an equidigital number, since it uses as much as digits as its factorization.
232001012213431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 232001012213431 its reverse (134312210100232), we get a palindrome (366313222313663).
The spelling of 232001012213431 in words is "two hundred thirty-two trillion, one billion, twelve million, two hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •