Base | Representation |
---|---|
bin | 1001000110101101111010… |
… | …11000111111011111110101 |
3 | 2121220002100000000000110112 |
4 | 10203112331120333133311 |
5 | 10111020044110341041 |
6 | 110325553343232405 |
7 | 4134354215026436 |
oct | 443267530773765 |
9 | 77802300000415 |
10 | 20022020012021 |
11 | 641a322361a85 |
12 | 22b4499ba8705 |
13 | b230b7321751 |
14 | 4d30dc92b48d |
15 | 24ac43118deb |
hex | 1235bd63f7f5 |
20022020012021 has 32 divisors (see below), whose sum is σ = 21093546700800. Its totient is φ = 18981691344000.
The previous prime is 20022020012009. The next prime is 20022020012041. The reversal of 20022020012021 is 12021002022002.
It is a de Polignac number, because none of the positive numbers 2k-20022020012021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20022020011987 and 20022020012005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20022020012041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 188245826 + ... + 188352156.
It is an arithmetic number, because the mean of its divisors is an integer number (659173334400).
Almost surely, 220022020012021 is an apocalyptic number.
It is an amenable number.
20022020012021 is a deficient number, since it is larger than the sum of its proper divisors (1071526688779).
20022020012021 is a wasteful number, since it uses less digits than its factorization.
20022020012021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107081.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 20022020012021 its reverse (12021002022002), we get a palindrome (32043022034023).
The spelling of 20022020012021 in words is "twenty trillion, twenty-two billion, twenty million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •