Base | Representation |
---|---|
bin | 1101011011100111110… |
… | …0000100111000100101 |
3 | 211001121120002210201212 |
4 | 3112321330010320211 |
5 | 12240040204102133 |
6 | 254001213201205 |
7 | 22446161303621 |
oct | 3267174047045 |
9 | 731546083655 |
10 | 230752800293 |
11 | 89952a38234 |
12 | 3887a790205 |
13 | 189b564c522 |
14 | b2504ca181 |
15 | 6008200148 |
hex | 35b9f04e25 |
230752800293 has 2 divisors, whose sum is σ = 230752800294. Its totient is φ = 230752800292.
The previous prime is 230752800217. The next prime is 230752800301. The reversal of 230752800293 is 392008257032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 152163966724 + 78588833569 = 390082^2 + 280337^2 .
It is a cyclic number.
It is not a de Polignac number, because 230752800293 - 216 = 230752734757 is a prime.
It is a super-2 number, since 2×2307528002932 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 230752800293.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230752820293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115376400146 + 115376400147.
It is an arithmetic number, because the mean of its divisors is an integer number (115376400147).
Almost surely, 2230752800293 is an apocalyptic number.
It is an amenable number.
230752800293 is a deficient number, since it is larger than the sum of its proper divisors (1).
230752800293 is an equidigital number, since it uses as much as digits as its factorization.
230752800293 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 181440, while the sum is 41.
The spelling of 230752800293 in words is "two hundred thirty billion, seven hundred fifty-two million, eight hundred thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •