Base | Representation |
---|---|
bin | 10010101001011110… |
… | …001001100001011100 |
3 | 1220200110000222200120 |
4 | 102221132021201130 |
5 | 312001404401022 |
6 | 13110512554540 |
7 | 1306122505005 |
oct | 225136114134 |
9 | 56613028616 |
10 | 20023122012 |
11 | 8545591a23 |
12 | 3a69852a50 |
13 | 1b714120ba |
14 | d7d3c41ac |
15 | 7c2cd6d5c |
hex | 4a978985c |
20023122012 has 12 divisors (see below), whose sum is σ = 46720618056. Its totient is φ = 6674374000.
The previous prime is 20023121999. The next prime is 20023122017. The reversal of 20023122012 is 21022132002.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-3 number, since 3×200231220123 (a number of 32 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20023121982 and 20023122000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20023122017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 834296739 + ... + 834296762.
It is an arithmetic number, because the mean of its divisors is an integer number (3893384838).
Almost surely, 220023122012 is an apocalyptic number.
It is an amenable number.
20023122012 is an abundant number, since it is smaller than the sum of its proper divisors (26697496044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20023122012 is a wasteful number, since it uses less digits than its factorization.
20023122012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1668593508 (or 1668593506 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 20023122012 its reverse (21022132002), we get a palindrome (41045254014).
The spelling of 20023122012 in words is "twenty billion, twenty-three million, one hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •