Base | Representation |
---|---|
bin | 10000000000101001101… |
… | …000100000001000001101 |
3 | 10220011211112102111211020 |
4 | 100000221220200020031 |
5 | 121011212242022424 |
6 | 2201232440544353 |
7 | 142326142433013 |
oct | 20005150401015 |
9 | 3804745374736 |
10 | 1100210110989 |
11 | 394661a1a540 |
12 | 15928a1820b9 |
13 | 7c9984927c2 |
14 | 3b37135c8b3 |
15 | 1d944156079 |
hex | 10029a2020d |
1100210110989 has 64 divisors (see below), whose sum is σ = 1625096798208. Its totient is φ = 656549683200.
The previous prime is 1100210110949. The next prime is 1100210111009. The reversal of 1100210110989 is 9890110120011.
It is not a de Polignac number, because 1100210110989 - 28 = 1100210110733 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100210110949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 603515332 + ... + 603517154.
It is an arithmetic number, because the mean of its divisors is an integer number (25392137472).
Almost surely, 21100210110989 is an apocalyptic number.
It is an amenable number.
1100210110989 is a deficient number, since it is larger than the sum of its proper divisors (524886687219).
1100210110989 is a wasteful number, since it uses less digits than its factorization.
1100210110989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2858.
The product of its (nonzero) digits is 1296, while the sum is 33.
The spelling of 1100210110989 in words is "one trillion, one hundred billion, two hundred ten million, one hundred ten thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •