Base | Representation |
---|---|
bin | 10101011100010010… |
… | …010001011000000000 |
3 | 2012102112002012010200 |
4 | 111130102101120000 |
5 | 334122410130422 |
6 | 14324321325200 |
7 | 1443351243213 |
oct | 253422213000 |
9 | 65375065120 |
10 | 23023130112 |
11 | 9844a58464 |
12 | 4566496800 |
13 | 222baca218 |
14 | 11859cd77a |
15 | 8eb37d2ac |
hex | 55c491600 |
23023130112 has 120 divisors (see below), whose sum is σ = 67357519944. Its totient is φ = 7569137664.
The previous prime is 23023130101. The next prime is 23023130113. The reversal of 23023130112 is 21103132032.
It is a super-2 number, since 2×230231301122 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23023130113) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 302163 + ... + 370605.
Almost surely, 223023130112 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 23023130112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33678759972).
23023130112 is an abundant number, since it is smaller than the sum of its proper divisors (44334389832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23023130112 is an equidigital number, since it uses as much as digits as its factorization.
23023130112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68540 (or 68521 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 23023130112 its reverse (21103132032), we get a palindrome (44126262144).
The spelling of 23023130112 in words is "twenty-three billion, twenty-three million, one hundred thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •