Base | Representation |
---|---|
bin | 10010110101011100… |
… | …011110111011100001 |
3 | 1221012110001020221112 |
4 | 102311130132323201 |
5 | 312404321341001 |
6 | 13142450433105 |
7 | 1314112160054 |
oct | 226534367341 |
9 | 57173036845 |
10 | 20224012001 |
11 | 8638a22606 |
12 | 3b04b92795 |
13 | 1ba3c1b50b |
14 | d9bd58a9b |
15 | 7d5769cbb |
hex | 4b571eee1 |
20224012001 has 4 divisors (see below), whose sum is σ = 20378393904. Its totient is φ = 20069630100.
The previous prime is 20224011989. The next prime is 20224012021. The reversal of 20224012001 is 10021042202.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10021042202 = 2 ⋅5010521101.
It is a cyclic number.
It is not a de Polignac number, because 20224012001 - 218 = 20223749857 is a prime.
It is a super-2 number, since 2×202240120012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20224012021) 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, 77190755 + ... + 77191016.
It is an arithmetic number, because the mean of its divisors is an integer number (5094598476).
Almost surely, 220224012001 is an apocalyptic number.
It is an amenable number.
20224012001 is a deficient number, since it is larger than the sum of its proper divisors (154381903).
20224012001 is a wasteful number, since it uses less digits than its factorization.
20224012001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 154381902.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 20224012001 its reverse (10021042202), we get a palindrome (30245054203).
The spelling of 20224012001 in words is "twenty billion, two hundred twenty-four million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •