Base | Representation |
---|---|
bin | 1010011101011010101110… |
… | …01010011011000011011000 |
3 | 10000102212122002101220001221 |
4 | 11032231113022123003120 |
5 | 11003322033112020440 |
6 | 120530304045021424 |
7 | 4562524345014034 |
oct | 516552712330330 |
9 | 100385562356057 |
10 | 23001012220120 |
11 | 7368746843770 |
12 | 26b5900554874 |
13 | caaca873c04c |
14 | 59737d7631c4 |
15 | 29d4983c1d4a |
hex | 14eb5729b0d8 |
23001012220120 has 32 divisors (see below), whose sum is σ = 56457029995920. Its totient is φ = 8364004443520.
The previous prime is 23001012220097. The next prime is 23001012220157. The reversal of 23001012220120 is 2102221010032.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 23001012220094 and 23001012220103.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26137513447 + ... + 26137514326.
Almost surely, 223001012220120 is an apocalyptic number.
23001012220120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23001012220120 is an abundant number, since it is smaller than the sum of its proper divisors (33456017775800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23001012220120 is a wasteful number, since it uses less digits than its factorization.
23001012220120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52275027795 (or 52275027791 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 23001012220120 its reverse (2102221010032), we get a palindrome (25103233230152).
The spelling of 23001012220120 in words is "twenty-three trillion, one billion, twelve million, two hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •