Base | Representation |
---|---|
bin | 10101011011100001… |
… | …011010011011000001 |
3 | 2012101121222110212100 |
4 | 111123201122123001 |
5 | 334111120301423 |
6 | 14323143021013 |
7 | 1443134340132 |
oct | 253341323301 |
9 | 65347873770 |
10 | 23010322113 |
11 | 98387aa639 |
12 | 456213a769 |
13 | 222926451c |
14 | 1184017c89 |
15 | 8ea19d343 |
hex | 55b85a6c1 |
23010322113 has 12 divisors (see below), whose sum is σ = 33864248340. Its totient is φ = 15050776416.
The previous prime is 23010322099. The next prime is 23010322121. The reversal of 23010322113 is 31122301032.
23010322113 is a `hidden beast` number, since 230 + 1 + 0 + 322 + 113 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 14184095409 + 8826226704 = 119097^2 + 93948^2 .
It is not a de Polignac number, because 23010322113 - 217 = 23010191041 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (23010322183) 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, 24119358 + ... + 24120311.
It is an arithmetic number, because the mean of its divisors is an integer number (2822020695).
Almost surely, 223010322113 is an apocalyptic number.
It is an amenable number.
23010322113 is a deficient number, since it is larger than the sum of its proper divisors (10853926227).
23010322113 is a wasteful number, since it uses less digits than its factorization.
23010322113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48239728 (or 48239725 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 23010322113 its reverse (31122301032), we get a palindrome (54132623145).
The spelling of 23010322113 in words is "twenty-three billion, ten million, three hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •