Base | Representation |
---|---|
bin | 1001000111001111110110… |
… | …1101001101010110110111 |
3 | 1022110220200101222101102212 |
4 | 2101303331231031112313 |
5 | 2303132201234033421 |
6 | 33151102451124035 |
7 | 2052633630403130 |
oct | 221637555152667 |
9 | 38426611871385 |
10 | 10020120221111 |
11 | 3213566705a30 |
12 | 1159b71ba361b |
13 | 578b7c7068c0 |
14 | 268d9538ac87 |
15 | 1259a6509e5b |
hex | 91cfdb4d5b7 |
10020120221111 has 16 divisors (see below), whose sum is σ = 13453587990528. Its totient is φ = 7207279279200.
The previous prime is 10020120221093. The next prime is 10020120221171. The reversal of 10020120221111 is 11112202102001.
It is not a de Polignac number, because 10020120221111 - 26 = 10020120221047 is a prime.
It is a super-4 number, since 4×100201202211114 (a number of 53 digits) contains 4444 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10020120221171) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5005054055 + ... + 5005056056.
It is an arithmetic number, because the mean of its divisors is an integer number (840849249408).
Almost surely, 210020120221111 is an apocalyptic number.
10020120221111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10020120221111 is a deficient number, since it is larger than the sum of its proper divisors (3433467769417).
10020120221111 is a wasteful number, since it uses less digits than its factorization.
10020120221111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10010110142.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10020120221111 its reverse (11112202102001), we get a palindrome (21132322323112).
The spelling of 10020120221111 in words is "ten trillion, twenty billion, one hundred twenty million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •