Base | Representation |
---|---|
bin | 11001000000101110011010… |
… | …100010010101100001101110 |
3 | 112102110222210211102122101020 |
4 | 121000232122202111201232 |
5 | 103404224022012011230 |
6 | 1025541432315355010 |
7 | 32112211220356650 |
oct | 3100563242254156 |
9 | 472428724378336 |
10 | 110001000110190 |
11 | 32060186929842 |
12 | 10406b20452a66 |
13 | 494c085549837 |
14 | 1d24110aba6d0 |
15 | cab5a2416810 |
hex | 640b9a89586e |
110001000110190 has 32 divisors (see below), whose sum is σ = 301717028874240. Its totient is φ = 25143085739424.
The previous prime is 110001000110189. The next prime is 110001000110207. The reversal of 110001000110190 is 91011000100011.
It is a super-2 number, since 2×1100010001101902 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 261907142910 + ... + 261907143329.
It is an arithmetic number, because the mean of its divisors is an integer number (9428657152320).
Almost surely, 2110001000110190 is an apocalyptic number.
110001000110190 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110001000110190 is an abundant number, since it is smaller than the sum of its proper divisors (191716028764050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110001000110190 is a wasteful number, since it uses less digits than its factorization.
110001000110190 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523814286256.
The product of its (nonzero) digits is 9, while the sum is 15.
The spelling of 110001000110190 in words is "one hundred ten trillion, one billion, one hundred ten thousand, one hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •