Base | Representation |
---|---|
bin | 10101011011100100… |
… | …110101111000010100 |
3 | 2012101200200010220220 |
4 | 111123210311320110 |
5 | 334111333033022 |
6 | 14323214154340 |
7 | 1443145102623 |
oct | 253344657024 |
9 | 65350603826 |
10 | 23011221012 |
11 | 9839263a2a |
12 | 45624b29b0 |
13 | 22294ba710 |
14 | 11841ad6ba |
15 | 8ea2c985c |
hex | 55b935e14 |
23011221012 has 192 divisors, whose sum is σ = 63784433664. Its totient is φ = 6389268480.
The previous prime is 23011220977. The next prime is 23011221061. The reversal of 23011221012 is 21012211032.
It is a super-2 number, since 2×230112210122 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23011220982 and 23011221000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 9288718 + ... + 9291194.
It is an arithmetic number, because the mean of its divisors is an integer number (332210592).
Almost surely, 223011221012 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 23011221012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31892216832).
23011221012 is an abundant number, since it is smaller than the sum of its proper divisors (40773212652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23011221012 is a wasteful number, since it uses less digits than its factorization.
23011221012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2658 (or 2656 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 23011221012 its reverse (21012211032), we get a palindrome (44023432044).
The spelling of 23011221012 in words is "twenty-three billion, eleven million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.009 sec. • engine limits •