Base | Representation |
---|---|
bin | 1001010100101010111000… |
… | …11100111110001011110101 |
3 | 2200120220202220110212102220 |
4 | 10222111130130332023311 |
5 | 10141343412040034141 |
6 | 111334121003152553 |
7 | 4214115355512444 |
oct | 452253434761365 |
9 | 80526686425386 |
10 | 20501430002421 |
11 | 6594675846515 |
12 | 2371393515759 |
13 | b59379786394 |
14 | 50c3bb362d5b |
15 | 2584512d8766 |
hex | 12a55c73e2f5 |
20501430002421 has 16 divisors (see below), whose sum is σ = 28254999183360. Its totient is φ = 13208927200560.
The previous prime is 20501430002411. The next prime is 20501430002429. The reversal of 20501430002421 is 12420003410502.
It is not a de Polignac number, because 20501430002421 - 225 = 20501396447989 is a prime.
It is a super-2 number, since 2×205014300024212 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20501430002391 and 20501430002400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20501430002429) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 148279141 + ... + 148417338.
It is an arithmetic number, because the mean of its divisors is an integer number (1765937448960).
Almost surely, 220501430002421 is an apocalyptic number.
It is an amenable number.
20501430002421 is a deficient number, since it is larger than the sum of its proper divisors (7753569180939).
20501430002421 is a wasteful number, since it uses less digits than its factorization.
20501430002421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296697256.
The product of its (nonzero) digits is 1920, while the sum is 24.
Adding to 20501430002421 its reverse (12420003410502), we get a palindrome (32921433412923).
The spelling of 20501430002421 in words is "twenty trillion, five hundred one billion, four hundred thirty million, two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •