Base | Representation |
---|---|
bin | 10101011100101111… |
… | …110010010110000101 |
3 | 2012110001122021121102 |
4 | 111130233302112011 |
5 | 334131400223313 |
6 | 14325155225445 |
7 | 1443504066545 |
oct | 253457622605 |
9 | 65401567542 |
10 | 23030867333 |
11 | 9849362561 |
12 | 4568ba8285 |
13 | 22305a8b66 |
14 | 1186a45325 |
15 | 8ebdaaa58 |
hex | 55cbf2585 |
23030867333 has 2 divisors, whose sum is σ = 23030867334. Its totient is φ = 23030867332.
The previous prime is 23030867303. The next prime is 23030867371. The reversal of 23030867333 is 33376803032.
It is an a-pointer prime, because the next prime (23030867371) can be obtained adding 23030867333 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22538116129 + 492751204 = 150127^2 + 22198^2 .
It is a cyclic number.
It is not a de Polignac number, because 23030867333 - 218 = 23030605189 is a prime.
It is a super-2 number, since 2×230308673332 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23030867303) 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, 11515433666 + 11515433667.
It is an arithmetic number, because the mean of its divisors is an integer number (11515433667).
Almost surely, 223030867333 is an apocalyptic number.
It is an amenable number.
23030867333 is a deficient number, since it is larger than the sum of its proper divisors (1).
23030867333 is an equidigital number, since it uses as much as digits as its factorization.
23030867333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 163296, while the sum is 38.
The spelling of 23030867333 in words is "twenty-three billion, thirty million, eight hundred sixty-seven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •