Base | Representation |
---|---|
bin | 110100110010111110000100… |
… | …110100100111101111110001 |
3 | 1010110011012111002101121212211 |
4 | 310302332010310213233301 |
5 | 220413340220044413244 |
6 | 2141503404304252121 |
7 | 66623654236323325 |
oct | 6462760464475761 |
9 | 1113135432347784 |
10 | 232201045310449 |
11 | 67a93a01677616 |
12 | 22062150311041 |
13 | 9c746069c4547 |
14 | 414a83a6c5985 |
15 | 1bca136e4b934 |
hex | d32f84d27bf1 |
232201045310449 has 2 divisors, whose sum is σ = 232201045310450. Its totient is φ = 232201045310448.
The previous prime is 232201045310411. The next prime is 232201045310489. The reversal of 232201045310449 is 944013540102232.
It is an a-pointer prime, because the next prime (232201045310489) can be obtained adding 232201045310449 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 232166382318049 + 34662992400 = 15237007^2 + 186180^2 .
It is a cyclic number.
It is not a de Polignac number, because 232201045310449 - 243 = 223404952288241 is a prime.
It is not a weakly prime, because it can be changed into another prime (232201045310489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116100522655224 + 116100522655225.
It is an arithmetic number, because the mean of its divisors is an integer number (116100522655225).
Almost surely, 2232201045310449 is an apocalyptic number.
It is an amenable number.
232201045310449 is a deficient number, since it is larger than the sum of its proper divisors (1).
232201045310449 is an equidigital number, since it uses as much as digits as its factorization.
232201045310449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 207360, while the sum is 40.
The spelling of 232201045310449 in words is "two hundred thirty-two trillion, two hundred one billion, forty-five million, three hundred ten thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •