Base | Representation |
---|---|
bin | 1101011101101011111… |
… | …0001101010111010001 |
3 | 211010001011221110000112 |
4 | 3113122332031113101 |
5 | 12242204043214231 |
6 | 254132211531105 |
7 | 22466001060116 |
oct | 3273276152721 |
9 | 733034843015 |
10 | 231307007441 |
11 | 8a107859274 |
12 | 389b42b9a95 |
13 | 18a73403953 |
14 | b2a3d5290d |
15 | 603bbc492b |
hex | 35daf8d5d1 |
231307007441 has 2 divisors, whose sum is σ = 231307007442. Its totient is φ = 231307007440.
The previous prime is 231307007411. The next prime is 231307007473. The reversal of 231307007441 is 144700703132.
It is an a-pointer prime, because the next prime (231307007473) can be obtained adding 231307007441 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 227024613841 + 4282393600 = 476471^2 + 65440^2 .
It is a cyclic number.
It is not a de Polignac number, because 231307007441 - 214 = 231306991057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 231307007398 and 231307007407.
It is not a weakly prime, because it can be changed into another prime (231307007411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115653503720 + 115653503721.
It is an arithmetic number, because the mean of its divisors is an integer number (115653503721).
Almost surely, 2231307007441 is an apocalyptic number.
It is an amenable number.
231307007441 is a deficient number, since it is larger than the sum of its proper divisors (1).
231307007441 is an equidigital number, since it uses as much as digits as its factorization.
231307007441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14112, while the sum is 32.
The spelling of 231307007441 in words is "two hundred thirty-one billion, three hundred seven million, seven thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •