Base | Representation |
---|---|
bin | 11001000010010011111100… |
… | …000101111000100010101010 |
3 | 112102212102011222122200000200 |
4 | 121002103330011320202222 |
5 | 103413020300304013002 |
6 | 1030103501333213030 |
7 | 32123120501556105 |
oct | 3102237405704252 |
9 | 472772158580020 |
10 | 110110011001002 |
11 | 320a2436714541 |
12 | 10424083a91176 |
13 | 4959438b5071c |
14 | 1d294d278973c |
15 | cae33277eb1c |
hex | 6424fc1788aa |
110110011001002 has 48 divisors (see below), whose sum is σ = 246270709082112. Its totient is φ = 35518902965280.
The previous prime is 110110011000989. The next prime is 110110011001031. The reversal of 110110011001002 is 200100110011011.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 43726023 + ... + 46175589.
It is an arithmetic number, because the mean of its divisors is an integer number (5130639772544).
Almost surely, 2110110011001002 is an apocalyptic number.
110110011001002 is an abundant number, since it is smaller than the sum of its proper divisors (136160698081110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110110011001002 is a wasteful number, since it uses less digits than its factorization.
110110011001002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2530163 (or 2530160 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110110011001002 its reverse (200100110011011), we get a palindrome (310210121012013).
The spelling of 110110011001002 in words is "one hundred ten trillion, one hundred ten billion, eleven million, one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •