Base | Representation |
---|---|
bin | 10101100001101001… |
… | …000110011010011001 |
3 | 2012122210012002021022 |
4 | 111201221012122121 |
5 | 334313412004401 |
6 | 14341251452225 |
7 | 1445522156255 |
oct | 254151063231 |
9 | 65583162238 |
10 | 23113000601 |
11 | 9890760499 |
12 | 45905b7075 |
13 | 2244605222 |
14 | 1193905265 |
15 | 9041d171b |
hex | 561a46699 |
23113000601 has 2 divisors, whose sum is σ = 23113000602. Its totient is φ = 23113000600.
The previous prime is 23113000597. The next prime is 23113000613. The reversal of 23113000601 is 10600031132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17145283600 + 5967717001 = 130940^2 + 77251^2 .
It is a cyclic number.
It is not a de Polignac number, because 23113000601 - 22 = 23113000597 is a prime.
It is a super-2 number, since 2×231130006012 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 23113000601.
It is not a weakly prime, because it can be changed into another prime (23113000681) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11556500300 + 11556500301.
It is an arithmetic number, because the mean of its divisors is an integer number (11556500301).
Almost surely, 223113000601 is an apocalyptic number.
It is an amenable number.
23113000601 is a deficient number, since it is larger than the sum of its proper divisors (1).
23113000601 is an equidigital number, since it uses as much as digits as its factorization.
23113000601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 23113000601 its reverse (10600031132), we get a palindrome (33713031733).
The spelling of 23113000601 in words is "twenty-three billion, one hundred thirteen million, six hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •