Base | Representation |
---|---|
bin | 11001000000101101100101… |
… | …011110110101011101001110 |
3 | 112102110220111210112100200022 |
4 | 121000231211132311131032 |
5 | 103404220211124444300 |
6 | 1025541204121302142 |
7 | 32112150161511242 |
oct | 3100554536653516 |
9 | 472426453470608 |
10 | 110000109999950 |
11 | 3205a86a441845 |
12 | 10406912334952 |
13 | 494bc730067a1 |
14 | 1d240687b6422 |
15 | cab54e1e0285 |
hex | 640b657b574e |
110000109999950 has 12 divisors (see below), whose sum is σ = 204600204600000. Its totient is φ = 44000043999960.
The previous prime is 110000109999887. The next prime is 110000109999979. The reversal of 110000109999950 is 59999901000011.
It is a junction number, because it is equal to n+sod(n) for n = 110000109999892 and 110000109999901.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1100001099950 + ... + 1100001100049.
It is an arithmetic number, because the mean of its divisors is an integer number (17050017050000).
Almost surely, 2110000109999950 is an apocalyptic number.
110000109999950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110000109999950 is a deficient number, since it is larger than the sum of its proper divisors (94600094600050).
110000109999950 is a wasteful number, since it uses less digits than its factorization.
110000109999950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2200002200011 (or 2200002200006 counting only the distinct ones).
The product of its (nonzero) digits is 295245, while the sum is 53.
The spelling of 110000109999950 in words is "one hundred ten trillion, one hundred nine million, nine hundred ninety-nine thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •