Base | Representation |
---|---|
bin | 11001000010001010101000… |
… | …000010111100101110111010 |
3 | 112102211110101001220112121200 |
4 | 121002022220002330232322 |
5 | 103412334310304323002 |
6 | 1030055125150515030 |
7 | 32122314624215235 |
oct | 3102125002745672 |
9 | 472743331815550 |
10 | 110100011011002 |
11 | 32099174a06aa1 |
12 | 10422152b05a76 |
13 | 495850416798c |
14 | 1d28c2462a41c |
15 | cade498c4b1c |
hex | 6422a80bcbba |
110100011011002 has 48 divisors (see below), whose sum is σ = 243628954208640. Its totient is φ = 35918651552256.
The previous prime is 110100011010973. The next prime is 110100011011091. The reversal of 110100011011002 is 200110110001011.
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, 62392858 + ... + 64133210.
It is an arithmetic number, because the mean of its divisors is an integer number (5075603212680).
Almost surely, 2110100011011002 is an apocalyptic number.
110100011011002 is an abundant number, since it is smaller than the sum of its proper divisors (133528943197638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110100011011002 is a wasteful number, since it uses less digits than its factorization.
110100011011002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1815187 (or 1815184 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110100011011002 its reverse (200110110001011), we get a palindrome (310210121012013).
The spelling of 110100011011002 in words is "one hundred ten trillion, one hundred billion, eleven million, eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •