Base | Representation |
---|---|
bin | 10101100010110101… |
… | …011011100011000001 |
3 | 2012201011211200011100 |
4 | 111202311123203001 |
5 | 334334022310423 |
6 | 14343244405013 |
7 | 1446154225113 |
oct | 254265334301 |
9 | 65634750140 |
10 | 23133010113 |
11 | 98a0a87984 |
12 | 4597246769 |
13 | 22487bca85 |
14 | 11964333b3 |
15 | 905d35343 |
hex | 562d5b8c1 |
23133010113 has 12 divisors (see below), whose sum is σ = 33480001620. Its totient is φ = 15391705056.
The previous prime is 23133010111. The next prime is 23133010133. The reversal of 23133010113 is 31101033132.
It is a happy number.
23133010113 is a `hidden beast` number, since 231 + 330 + 101 + 1 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 15842753424 + 7290256689 = 125868^2 + 85383^2 .
It is not a de Polignac number, because 23133010113 - 21 = 23133010111 is a prime.
It is not an unprimeable number, because it can be changed into a prime (23133010111) 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 in 11 ways as a sum of consecutive naturals, for example, 2520306 + ... + 2529467.
It is an arithmetic number, because the mean of its divisors is an integer number (2790000135).
Almost surely, 223133010113 is an apocalyptic number.
It is an amenable number.
23133010113 is a deficient number, since it is larger than the sum of its proper divisors (10346991507).
23133010113 is a wasteful number, since it uses less digits than its factorization.
23133010113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5050288 (or 5050285 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 23133010113 its reverse (31101033132), we get a palindrome (54234043245).
The spelling of 23133010113 in words is "twenty-three billion, one hundred thirty-three million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •