Base | Representation |
---|---|
bin | 1101011001010011101… |
… | …1111101010100100001 |
3 | 211000000021222111201202 |
4 | 3112110323331110201 |
5 | 12232302243343241 |
6 | 253415435410545 |
7 | 22424612554301 |
oct | 3262473752441 |
9 | 730007874652 |
10 | 230132012321 |
11 | 89664581022 |
12 | 387268b3a55 |
13 | 18916b55973 |
14 | b1d1c91601 |
15 | 5ebd977d9b |
hex | 3594efd521 |
230132012321 has 2 divisors, whose sum is σ = 230132012322. Its totient is φ = 230132012320.
The previous prime is 230132012291. The next prime is 230132012323. The reversal of 230132012321 is 123210231032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 182329000000 + 47803012321 = 427000^2 + 218639^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-230132012321 is a prime.
It is a Sophie Germain prime.
Together with 230132012323, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 230132012293 and 230132012302.
It is not a weakly prime, because it can be changed into another prime (230132012323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115066006160 + 115066006161.
It is an arithmetic number, because the mean of its divisors is an integer number (115066006161).
Almost surely, 2230132012321 is an apocalyptic number.
It is an amenable number.
230132012321 is a deficient number, since it is larger than the sum of its proper divisors (1).
230132012321 is an equidigital number, since it uses as much as digits as its factorization.
230132012321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 230132012321 its reverse (123210231032), we get a palindrome (353342243353).
The spelling of 230132012321 in words is "two hundred thirty billion, one hundred thirty-two million, twelve thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •