Base | Representation |
---|---|
bin | 10000001001111101001… |
… | …101010101011011100101 |
3 | 10221010121220022201212011 |
4 | 100021331031111123211 |
5 | 121142143231210041 |
6 | 2210004142154221 |
7 | 143131563040042 |
oct | 20117515253345 |
9 | 3833556281764 |
10 | 1110202210021 |
11 | 39891a228423 |
12 | 15b1b8582971 |
13 | 808cb644938 |
14 | 3ba3c4261c9 |
15 | 1dd2b4a2e81 |
hex | 1027d3556e5 |
1110202210021 has 16 divisors (see below), whose sum is σ = 1140680681536. Its totient is φ = 1079941838976.
The previous prime is 1110202210009. The next prime is 1110202210031. The reversal of 1110202210021 is 1200122020111.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1110202210021 is a prime.
It is a super-3 number, since 3×11102022100213 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110202209983 and 1110202210010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110202210031) 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, 15077731 + ... + 15151183.
It is an arithmetic number, because the mean of its divisors is an integer number (71292542596).
Almost surely, 21110202210021 is an apocalyptic number.
It is an amenable number.
1110202210021 is a deficient number, since it is larger than the sum of its proper divisors (30478471515).
1110202210021 is a wasteful number, since it uses less digits than its factorization.
1110202210021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74932.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1110202210021 its reverse (1200122020111), we get a palindrome (2310324230132).
The spelling of 1110202210021 in words is "one trillion, one hundred ten billion, two hundred two million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •