Base | Representation |
---|---|
bin | 10101111011111011… |
… | …100101101111100001 |
3 | 2020210112002222100111 |
4 | 111323323211233201 |
5 | 341214314231022 |
6 | 14453125051321 |
7 | 1462456110454 |
oct | 257373455741 |
9 | 66715088314 |
10 | 23554055137 |
11 | 9a97717278 |
12 | 4694256b41 |
13 | 22b4abc342 |
14 | 11d631549b |
15 | 92cca4477 |
hex | 57bee5be1 |
23554055137 has 2 divisors, whose sum is σ = 23554055138. Its totient is φ = 23554055136.
The previous prime is 23554055131. The next prime is 23554055177. The reversal of 23554055137 is 73155045532.
It is a happy number.
It is an a-pointer prime, because the next prime (23554055177) can be obtained adding 23554055137 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23545061136 + 8994001 = 153444^2 + 2999^2 .
It is a cyclic number.
It is not a de Polignac number, because 23554055137 - 27 = 23554055009 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23554055137.
It is not a weakly prime, because it can be changed into another prime (23554055131) 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, 11777027568 + 11777027569.
It is an arithmetic number, because the mean of its divisors is an integer number (11777027569).
Almost surely, 223554055137 is an apocalyptic number.
It is an amenable number.
23554055137 is a deficient number, since it is larger than the sum of its proper divisors (1).
23554055137 is an equidigital number, since it uses as much as digits as its factorization.
23554055137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 315000, while the sum is 40.
The spelling of 23554055137 in words is "twenty-three billion, five hundred fifty-four million, fifty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •