Base | Representation |
---|---|
bin | 101101101101001111011111… |
… | …010000111101011111010110 |
3 | 222100202102121002122122021012 |
4 | 231231033133100331133112 |
5 | 202322012203112320042 |
6 | 1551311452444452222 |
7 | 60225203154163460 |
oct | 5555173720753726 |
9 | 870672532578235 |
10 | 201021100120022 |
11 | 5906262a454766 |
12 | 1a66729b84a072 |
13 | 8822292b25830 |
14 | 378d68a4c3130 |
15 | 1839047e2ce82 |
hex | b6d3df43d7d6 |
201021100120022 has 64 divisors (see below), whose sum is σ = 376397800224768. Its totient is φ = 78393317184000.
The previous prime is 201021100120021. The next prime is 201021100120063. The reversal of 201021100120022 is 220021001120102.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 201021100119979 and 201021100120006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201021100120021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 87655022 + ... + 89919102.
It is an arithmetic number, because the mean of its divisors is an integer number (5881215628512).
Almost surely, 2201021100120022 is an apocalyptic number.
201021100120022 is a deficient number, since it is larger than the sum of its proper divisors (175376700104746).
201021100120022 is a wasteful number, since it uses less digits than its factorization.
201021100120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2271045.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201021100120022 its reverse (220021001120102), we get a palindrome (421042101240124).
The spelling of 201021100120022 in words is "two hundred one trillion, twenty-one billion, one hundred million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •