Base | Representation |
---|---|
bin | 1101011001001100111… |
… | …0000011100110011001 |
3 | 210222221021202210200021 |
4 | 3112103032003212121 |
5 | 12232222404432301 |
6 | 253412530110441 |
7 | 22424112642625 |
oct | 3262316034631 |
9 | 728837683607 |
10 | 230103202201 |
11 | 8964a293604 |
12 | 3871911b421 |
13 | 18910ba9462 |
14 | b1cc112185 |
15 | 5ebb1868a1 |
hex | 3593383999 |
230103202201 has 2 divisors, whose sum is σ = 230103202202. Its totient is φ = 230103202200.
The previous prime is 230103202193. The next prime is 230103202243. The reversal of 230103202201 is 102202301032.
230103202201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 117676441600 + 112426760601 = 343040^2 + 335301^2 .
It is a cyclic number.
It is not a de Polignac number, because 230103202201 - 23 = 230103202193 is a prime.
It is not a weakly prime, because it can be changed into another prime (230103202001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115051601100 + 115051601101.
It is an arithmetic number, because the mean of its divisors is an integer number (115051601101).
Almost surely, 2230103202201 is an apocalyptic number.
It is an amenable number.
230103202201 is a deficient number, since it is larger than the sum of its proper divisors (1).
230103202201 is an equidigital number, since it uses as much as digits as its factorization.
230103202201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 230103202201 its reverse (102202301032), we get a palindrome (332305503233).
The spelling of 230103202201 in words is "two hundred thirty billion, one hundred three million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •