Base | Representation |
---|---|
bin | 10000001001110111101… |
… | …010001011111011111010 |
3 | 10221010101102010202122121 |
4 | 100021313222023323322 |
5 | 121142000413010020 |
6 | 2205551014511454 |
7 | 143126352513325 |
oct | 20116752137372 |
9 | 3833342122577 |
10 | 1110109110010 |
11 | 398881719a6a |
12 | 15b19136558a |
13 | 808b5278984 |
14 | 3ba2dd0d7bc |
15 | 1dd23212baa |
hex | 10277a8befa |
1110109110010 has 8 divisors (see below), whose sum is σ = 1998196398036. Its totient is φ = 444043644000.
The previous prime is 1110109109983. The next prime is 1110109110031. The reversal of 1110109110010 is 100119010111.
It can be written as a sum of positive squares in 2 ways, for example, as 1090430912169 + 19678197841 = 1044237^2 + 140279^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×11101091100102 (a number of 25 digits) contains 22 as substring.
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 3 ways as a sum of consecutive naturals, for example, 55505455491 + ... + 55505455510.
Almost surely, 21110109110010 is an apocalyptic number.
1110109110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1110109110010 is a deficient number, since it is larger than the sum of its proper divisors (888087288026).
1110109110010 is a wasteful number, since it uses less digits than its factorization.
1110109110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111010911008.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 1110109110010 in words is "one trillion, one hundred ten billion, one hundred nine million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •