Base | Representation |
---|---|
bin | 10101011100101111… |
… | …110000110101000100 |
3 | 2012110001121222002110 |
4 | 111130233300311010 |
5 | 334131400023444 |
6 | 14325155141020 |
7 | 1443504042465 |
oct | 253457606504 |
9 | 65401558073 |
10 | 23030861124 |
11 | 9849358927 |
12 | 4568ba4770 |
13 | 22305a609b |
14 | 1186a42d6c |
15 | 8ebda8cb9 |
hex | 55cbf0d44 |
23030861124 has 96 divisors (see below), whose sum is σ = 58019512320. Its totient is φ = 7089667200.
The previous prime is 23030861123. The next prime is 23030861137. The reversal of 23030861124 is 42116803032.
It is a super-2 number, since 2×230308611242 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23030861091 and 23030861100.
It is not an unprimeable number, because it can be changed into a prime (23030861123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3941397 + ... + 3947235.
It is an arithmetic number, because the mean of its divisors is an integer number (604369920).
Almost surely, 223030861124 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23030861124, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29009756160).
23030861124 is an abundant number, since it is smaller than the sum of its proper divisors (34988651196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23030861124 is a wasteful number, since it uses less digits than its factorization.
23030861124 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6361 (or 6359 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
The spelling of 23030861124 in words is "twenty-three billion, thirty million, eight hundred sixty-one thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •