Base | Representation |
---|---|
bin | 110100110011000001111100… |
… | …011110000010110100111111 |
3 | 1010110011121012122102220210012 |
4 | 310303001330132002310333 |
5 | 220413422222214013011 |
6 | 2141505332444533435 |
7 | 66624162216650633 |
oct | 6463017436026477 |
9 | 1113147178386705 |
10 | 232205200141631 |
11 | 67a957439a27a2 |
12 | 22062b0b85127b |
13 | 9c74b19716b32 |
14 | 414ab12420dc3 |
15 | 1bca2cbaa7a8b |
hex | d3307c782d3f |
232205200141631 has 2 divisors, whose sum is σ = 232205200141632. Its totient is φ = 232205200141630.
The previous prime is 232205200141543. The next prime is 232205200141633. The reversal of 232205200141631 is 136141002502232.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 232205200141631 - 230 = 232204126399807 is a prime.
It is a super-2 number, since 2×2322052001416312 (a number of 30 digits) contains 22 as substring.
Together with 232205200141633, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232205200141633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116102600070815 + 116102600070816.
It is an arithmetic number, because the mean of its divisors is an integer number (116102600070816).
Almost surely, 2232205200141631 is an apocalyptic number.
232205200141631 is a deficient number, since it is larger than the sum of its proper divisors (1).
232205200141631 is an equidigital number, since it uses as much as digits as its factorization.
232205200141631 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 232205200141631 its reverse (136141002502232), we get a palindrome (368346202643863).
The spelling of 232205200141631 in words is "two hundred thirty-two trillion, two hundred five billion, two hundred million, one hundred forty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •