Base | Representation |
---|---|
bin | 1001001001010010001010… |
… | …11001100110110000011010 |
3 | 2122012111221111111112010221 |
4 | 10210221011121212300122 |
5 | 10113441143003020442 |
6 | 110434255432430254 |
7 | 4143625350650626 |
oct | 444510531466032 |
9 | 78174844445127 |
10 | 20110201220122 |
11 | 6453763353872 |
12 | 23095a984838a |
13 | b2b4cb3a43b0 |
14 | 4d74a6060186 |
15 | 24d1a4979467 |
hex | 124a45666c1a |
20110201220122 has 16 divisors (see below), whose sum is σ = 32490502057440. Its totient is φ = 9280262076912.
The previous prime is 20110201220107. The next prime is 20110201220129. The reversal of 20110201220122 is 22102210201102.
It is a happy number.
It is a super-2 number, since 2×201102012201222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20110201220096 and 20110201220105.
It is not an unprimeable number, because it can be changed into a prime (20110201220129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56872668 + ... + 57225175.
It is an arithmetic number, because the mean of its divisors is an integer number (2030656378590).
Almost surely, 220110201220122 is an apocalyptic number.
20110201220122 is a deficient number, since it is larger than the sum of its proper divisors (12380300837318).
20110201220122 is a wasteful number, since it uses less digits than its factorization.
20110201220122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114104637.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20110201220122 its reverse (22102210201102), we get a palindrome (42212411421224).
The spelling of 20110201220122 in words is "twenty trillion, one hundred ten billion, two hundred one million, two hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •