Base | Representation |
---|---|
bin | 1101011000110111001… |
… | …1010011001111011101 |
3 | 210222200221201121110022 |
4 | 3112031303103033131 |
5 | 12232031122133201 |
6 | 253355521521525 |
7 | 22421630211425 |
oct | 3261563231735 |
9 | 728627647408 |
10 | 230012302301 |
11 | 89602a48121 |
12 | 386b27a32a5 |
13 | 188c8100a32 |
14 | b1c000d485 |
15 | 5eb31cd41b |
hex | 358dcd33dd |
230012302301 has 2 divisors, whose sum is σ = 230012302302. Its totient is φ = 230012302300.
The previous prime is 230012302283. The next prime is 230012302321. The reversal of 230012302301 is 103203210032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 210208495225 + 19803807076 = 458485^2 + 140726^2 .
It is a cyclic number.
It is not a de Polignac number, because 230012302301 - 218 = 230012040157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 230012302301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230012302321) 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, 115006151150 + 115006151151.
It is an arithmetic number, because the mean of its divisors is an integer number (115006151151).
Almost surely, 2230012302301 is an apocalyptic number.
It is an amenable number.
230012302301 is a deficient number, since it is larger than the sum of its proper divisors (1).
230012302301 is an equidigital number, since it uses as much as digits as its factorization.
230012302301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 230012302301 its reverse (103203210032), we get a palindrome (333215512333).
The spelling of 230012302301 in words is "two hundred thirty billion, twelve million, three hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •