Base | Representation |
---|---|
bin | 10010110000000101… |
… | …001100111101101101 |
3 | 1220222011201100021100 |
4 | 102300011030331231 |
5 | 312213302214041 |
6 | 13125513553313 |
7 | 1311640241400 |
oct | 226005147555 |
9 | 56864640240 |
10 | 20134023021 |
11 | 85a2149552 |
12 | 3a9aa15839 |
13 | 1b8b3a15b8 |
14 | d90011d37 |
15 | 7cc8e16b6 |
hex | 4b014cf6d |
20134023021 has 36 divisors (see below), whose sum is σ = 33847125312. Its totient is φ = 11499549264.
The previous prime is 20134023017. The next prime is 20134023023. The reversal of 20134023021 is 12032043102.
20134023021 is a `hidden beast` number, since 20 + 1 + 340 + 2 + 302 + 1 = 666.
It is not a de Polignac number, because 20134023021 - 22 = 20134023017 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20134022985 and 20134023003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20134023023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 998586 + ... + 1018548.
Almost surely, 220134023021 is an apocalyptic number.
20134023021 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20134023021 is a deficient number, since it is larger than the sum of its proper divisors (13713102291).
20134023021 is a wasteful number, since it uses less digits than its factorization.
20134023021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22270 (or 22260 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 20134023021 its reverse (12032043102), we get a palindrome (32166066123).
The spelling of 20134023021 in words is "twenty billion, one hundred thirty-four million, twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •