Base | Representation |
---|---|
bin | 11001000000110110111000… |
… | …111011101010100101010100 |
3 | 112102111212022000110222222012 |
4 | 121000312320323222211110 |
5 | 103404401141100013413 |
6 | 1025545535305523352 |
7 | 32112652555230116 |
oct | 3100667073524524 |
9 | 472455260428865 |
10 | 110010100001108 |
11 | 3206402654754a |
12 | 1040883baa3558 |
13 | 494cba5902a88 |
14 | 1d247354953b6 |
15 | cab9362757a8 |
hex | 640db8eea954 |
110010100001108 has 48 divisors (see below), whose sum is σ = 194704753541760. Its totient is φ = 54384419174400.
The previous prime is 110010100001107. The next prime is 110010100001129. The reversal of 110010100001108 is 801100001010011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 110010100001092 and 110010100001101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110010100001101) by changing a digit.
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, 108377660 + ... + 109388012.
It is an arithmetic number, because the mean of its divisors is an integer number (4056349032120).
Almost surely, 2110010100001108 is an apocalyptic number.
It is an amenable number.
110010100001108 is a deficient number, since it is larger than the sum of its proper divisors (84694653540652).
110010100001108 is a wasteful number, since it uses less digits than its factorization.
110010100001108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1011408 (or 1011406 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110010100001108 its reverse (801100001010011), we get a palindrome (911110101011119).
The spelling of 110010100001108 in words is "one hundred ten trillion, ten billion, one hundred million, one thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •