Base | Representation |
---|---|
bin | 10101011100101100… |
… | …110111100001100000 |
3 | 2012110000012101220220 |
4 | 111130230313201200 |
5 | 334131201231422 |
6 | 14325131003040 |
7 | 1443464431563 |
oct | 253454674140 |
9 | 65400171826 |
10 | 23030102112 |
11 | 984898a646 |
12 | 4568899480 |
13 | 223039b774 |
14 | 11868c64da |
15 | 8ebca8e5c |
hex | 55cb37860 |
23030102112 has 24 divisors (see below), whose sum is σ = 60454018296. Its totient is φ = 7676700672.
The previous prime is 23030102111. The next prime is 23030102119. The reversal of 23030102112 is 21120103032.
It is a tau number, because it is divible by the number of its divisors (24).
It is a junction number, because it is equal to n+sod(n) for n = 23030102091 and 23030102100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23030102111) 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 3 ways as a sum of consecutive naturals, for example, 119948353 + ... + 119948544.
It is an arithmetic number, because the mean of its divisors is an integer number (2518917429).
Almost surely, 223030102112 is an apocalyptic number.
It is an amenable number.
23030102112 is an abundant number, since it is smaller than the sum of its proper divisors (37423916184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23030102112 is a wasteful number, since it uses less digits than its factorization.
23030102112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239896910 (or 239896902 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 23030102112 its reverse (21120103032), we get a palindrome (44150205144).
The spelling of 23030102112 in words is "twenty-three billion, thirty million, one hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •