Base | Representation |
---|---|
bin | 1001000110101110000100… |
… | …01011010001000101000101 |
3 | 2121220002112121002002000010 |
4 | 10203113002023101011011 |
5 | 10111020230134100401 |
6 | 110330005332140433 |
7 | 4134356211332454 |
oct | 443270213210505 |
9 | 77802477062003 |
10 | 20022100300101 |
11 | 641a36370a669 |
12 | 22b4500a67719 |
13 | b230cab52ca3 |
14 | 4d310946ab9b |
15 | 24ac4a1c7ed6 |
hex | 1235c22d1145 |
20022100300101 has 8 divisors (see below), whose sum is σ = 26711846591200. Its totient is φ = 13340210437872.
The previous prime is 20022100299973. The next prime is 20022100300109. The reversal of 20022100300101 is 10100300122002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20022100300101 - 27 = 20022100299973 is a prime.
It is a super-2 number, since 2×200221003001012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20022100300109) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1964101270 + ... + 1964111463.
It is an arithmetic number, because the mean of its divisors is an integer number (3338980823900).
Almost surely, 220022100300101 is an apocalyptic number.
It is an amenable number.
20022100300101 is a deficient number, since it is larger than the sum of its proper divisors (6689746291099).
20022100300101 is a wasteful number, since it uses less digits than its factorization.
20022100300101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3928214435.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 20022100300101 its reverse (10100300122002), we get a palindrome (30122400422103).
The spelling of 20022100300101 in words is "twenty trillion, twenty-two billion, one hundred million, three hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •