Base | Representation |
---|---|
bin | 10101100110111001… |
… | …111110010110100000 |
3 | 2012212221100200010221 |
4 | 111212321332112200 |
5 | 340004013410422 |
6 | 14354124332424 |
7 | 1450643611351 |
oct | 254671762640 |
9 | 65787320127 |
10 | 23201310112 |
11 | 9926597762 |
12 | 45b60a4114 |
13 | 22599b4886 |
14 | 11a1531d28 |
15 | 90bd273c7 |
hex | 566e7e5a0 |
23201310112 has 48 divisors (see below), whose sum is σ = 46676794752. Its totient is φ = 11347176960.
The previous prime is 23201310091. The next prime is 23201310149. The reversal of 23201310112 is 21101310232.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3427243 + ... + 3434005.
It is an arithmetic number, because the mean of its divisors is an integer number (972433224).
Almost surely, 223201310112 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 23201310112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23338397376).
23201310112 is an abundant number, since it is smaller than the sum of its proper divisors (23475484640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23201310112 is a wasteful number, since it uses less digits than its factorization.
23201310112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9101 (or 9093 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 23201310112 its reverse (21101310232), we get a palindrome (44302620344).
The spelling of 23201310112 in words is "twenty-three billion, two hundred one million, three hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •