Base | Representation |
---|---|
bin | 10101101011111011… |
… | …010010000110001101 |
3 | 2020002210211221202021 |
4 | 111223323102012031 |
5 | 340142044223323 |
6 | 14410333530141 |
7 | 1453015550266 |
oct | 255373220615 |
9 | 66083757667 |
10 | 23285539213 |
11 | 996a097292 |
12 | 461a343951 |
13 | 2271295b91 |
14 | 11ac7b996d |
15 | 91441405d |
hex | 56bed218d |
23285539213 has 2 divisors, whose sum is σ = 23285539214. Its totient is φ = 23285539212.
The previous prime is 23285539177. The next prime is 23285539231. The reversal of 23285539213 is 31293558232.
Together with next prime (23285539231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23281266724 + 4272489 = 152582^2 + 2067^2 .
It is a cyclic number.
It is not a de Polignac number, because 23285539213 - 29 = 23285538701 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23285539213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23285539283) 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, 11642769606 + 11642769607.
It is an arithmetic number, because the mean of its divisors is an integer number (11642769607).
Almost surely, 223285539213 is an apocalyptic number.
It is an amenable number.
23285539213 is a deficient number, since it is larger than the sum of its proper divisors (1).
23285539213 is an equidigital number, since it uses as much as digits as its factorization.
23285539213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 388800, while the sum is 43.
The spelling of 23285539213 in words is "twenty-three billion, two hundred eighty-five million, five hundred thirty-nine thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •