Base | Representation |
---|---|
bin | 11101000110110110011… |
… | …01010011010110011110 |
3 | 10112121110101121121011021 |
4 | 32203123031103112132 |
5 | 112341211142010420 |
6 | 2043235542314354 |
7 | 132153442446526 |
oct | 16433315232636 |
9 | 3477411547137 |
10 | 1000110110110 |
11 | 3561650a2291 |
12 | 1419b2a289ba |
13 | 7340503c057 |
14 | 36596d0a686 |
15 | 1b0362667aa |
hex | e8db35359e |
1000110110110 has 32 divisors (see below), whose sum is σ = 1813944132000. Its totient is φ = 396994323840.
The previous prime is 1000110110107. The next prime is 1000110110147. The reversal of 1000110110110 is 110110110001.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1000110110093 and 1000110110102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1317976 + ... + 1933204.
It is an arithmetic number, because the mean of its divisors is an integer number (56685754125).
Almost surely, 21000110110110 is an apocalyptic number.
1000110110110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1000110110110 is a deficient number, since it is larger than the sum of its proper divisors (813834021890).
1000110110110 is a wasteful number, since it uses less digits than its factorization.
1000110110110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 616476.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1000110110110 its reverse (110110110001), we get a palindrome (1110220220111).
The spelling of 1000110110110 in words is "one trillion, one hundred ten million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •