Base | Representation |
---|---|
bin | 10101100111000000… |
… | …101010101010011101 |
3 | 2012220001122210200102 |
4 | 111213000222222131 |
5 | 340004441030402 |
6 | 14354230110445 |
7 | 1450664536205 |
oct | 254700525235 |
9 | 65801583612 |
10 | 23203064477 |
11 | 992758584a |
12 | 45b67ab425 |
13 | 225a17a268 |
14 | 11a186b405 |
15 | 90c072102 |
hex | 56702aa9d |
23203064477 has 2 divisors, whose sum is σ = 23203064478. Its totient is φ = 23203064476.
The previous prime is 23203064449. The next prime is 23203064497. The reversal of 23203064477 is 77446030232.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17253873316 + 5949191161 = 131354^2 + 77131^2 .
It is a cyclic number.
It is not a de Polignac number, because 23203064477 - 216 = 23202998941 is a prime.
It is a super-2 number, since 2×232030644772 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 23203064477.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23203064497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11601532238 + 11601532239.
It is an arithmetic number, because the mean of its divisors is an integer number (11601532239).
Almost surely, 223203064477 is an apocalyptic number.
It is an amenable number.
23203064477 is a deficient number, since it is larger than the sum of its proper divisors (1).
23203064477 is an equidigital number, since it uses as much as digits as its factorization.
23203064477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 169344, while the sum is 38.
The spelling of 23203064477 in words is "twenty-three billion, two hundred three million, sixty-four thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •