Base | Representation |
---|---|
bin | 11001000010001010101000… |
… | …000010111010010010101010 |
3 | 112102211110101001220000220022 |
4 | 121002022220002322102222 |
5 | 103412334310304013002 |
6 | 1030055125150400442 |
7 | 32122314624144131 |
oct | 3102125002722252 |
9 | 472743331800808 |
10 | 110100011001002 |
11 | 320991749aa530 |
12 | 10422152b00122 |
13 | 4958504163269 |
14 | 1d28c24626918 |
15 | cade498c1ba2 |
hex | 6422a80ba4aa |
110100011001002 has 32 divisors (see below), whose sum is σ = 181692019237248. Its totient is φ = 49622139000000.
The previous prime is 110100011000999. The next prime is 110100011001011. The reversal of 110100011001002 is 200100110001011.
It is a happy number.
It is a super-2 number, since 2×1101000110010022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28833749 + ... + 32428152.
It is an arithmetic number, because the mean of its divisors is an integer number (5677875601164).
Almost surely, 2110100011001002 is an apocalyptic number.
110100011001002 is a deficient number, since it is larger than the sum of its proper divisors (71592008236246).
110100011001002 is a wasteful number, since it uses less digits than its factorization.
110100011001002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61262606.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 110100011001002 its reverse (200100110001011), we get a palindrome (310200121002013).
Subtracting 110100011001002 from its reverse (200100110001011), we obtain a palindrome (90000099000009).
The spelling of 110100011001002 in words is "one hundred ten trillion, one hundred billion, eleven million, one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •