Base | Representation |
---|---|
bin | 11001000000110111101111… |
… | …001011011010101100101010 |
3 | 112102111221122102222210221221 |
4 | 121000313233023122230222 |
5 | 103404410022041200020 |
6 | 1025550205500252254 |
7 | 32113014246026515 |
oct | 3100675713325452 |
9 | 472457572883857 |
10 | 110011010100010 |
11 | 320644532472a8 |
12 | 10408a5484108a |
13 | 494ccbc324036 |
14 | 1d247c02bdd7c |
15 | cab98b0e96aa |
hex | 640def2dab2a |
110011010100010 has 16 divisors (see below), whose sum is σ = 198020559778272. Its totient is φ = 44004239240400.
The previous prime is 110011010099999. The next prime is 110011010100023. The reversal of 110011010100010 is 10001010110011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 110011010099966 and 110011010100002.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17777856 + ... + 23153275.
It is an arithmetic number, because the mean of its divisors is an integer number (12376284986142).
Almost surely, 2110011010100010 is an apocalyptic number.
110011010100010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110011010100010 is a deficient number, since it is larger than the sum of its proper divisors (88009549678262).
110011010100010 is a wasteful number, since it uses less digits than its factorization.
110011010100010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41199909.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110011010100010 its reverse (10001010110011), we get a palindrome (120012020210021).
The spelling of 110011010100010 in words is "one hundred ten trillion, eleven billion, ten million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •