Base | Representation |
---|---|
bin | 110100110000100000111010… |
… | …111001000001000010101011 |
3 | 1010102120001221000121212102012 |
4 | 310300200322321001002223 |
5 | 220403104123103132412 |
6 | 2141254100113030135 |
7 | 66605531505261116 |
oct | 6460407271010253 |
9 | 1112501830555365 |
10 | 232032301224107 |
11 | 67a29389a75a1a |
12 | 220354b825534b |
13 | 9c6172400a947 |
14 | 41425cd77557d |
15 | 1bc5a5c9d3c22 |
hex | d3083ae410ab |
232032301224107 has 2 divisors, whose sum is σ = 232032301224108. Its totient is φ = 232032301224106.
The previous prime is 232032301224071. The next prime is 232032301224149. The reversal of 232032301224107 is 701422103230232.
Together with previous prime (232032301224071) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 232032301224107 - 26 = 232032301224043 is a prime.
It is a super-2 number, since 2×2320323012241072 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (232032301224907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116016150612053 + 116016150612054.
It is an arithmetic number, because the mean of its divisors is an integer number (116016150612054).
Almost surely, 2232032301224107 is an apocalyptic number.
232032301224107 is a deficient number, since it is larger than the sum of its proper divisors (1).
232032301224107 is an equidigital number, since it uses as much as digits as its factorization.
232032301224107 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24192, while the sum is 32.
Adding to 232032301224107 its reverse (701422103230232), we get a palindrome (933454404454339).
The spelling of 232032301224107 in words is "two hundred thirty-two trillion, thirty-two billion, three hundred one million, two hundred twenty-four thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •