Base | Representation |
---|---|
bin | 110100110000001100010001… |
… | …100011111111011001000101 |
3 | 1010102110221201002012220112212 |
4 | 310300030101203333121011 |
5 | 220402223223022304424 |
6 | 2141235552251153205 |
7 | 66604115244462215 |
oct | 6460142143773105 |
9 | 1112427632186485 |
10 | 232010133009989 |
11 | 67a1aa43657604 |
12 | 22031150145805 |
13 | 9c5c600380499 |
14 | 41414c9528245 |
15 | 1bc51b172910e |
hex | d303118ff645 |
232010133009989 has 2 divisors, whose sum is σ = 232010133009990. Its totient is φ = 232010133009988.
The previous prime is 232010133009971. The next prime is 232010133010081. The reversal of 232010133009989 is 989900331010232.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 202765724013889 + 29244408996100 = 14239583^2 + 5407810^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-232010133009989 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232010133009289) 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, 116005066504994 + 116005066504995.
It is an arithmetic number, because the mean of its divisors is an integer number (116005066504995).
Almost surely, 2232010133009989 is an apocalyptic number.
It is an amenable number.
232010133009989 is a deficient number, since it is larger than the sum of its proper divisors (1).
232010133009989 is an equidigital number, since it uses as much as digits as its factorization.
232010133009989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 629856, while the sum is 50.
The spelling of 232010133009989 in words is "two hundred thirty-two trillion, ten billion, one hundred thirty-three million, nine thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •