Base | Representation |
---|---|
bin | 11001000000101110100001… |
… | …000101111101001100011001 |
3 | 112102111000002111102021010100 |
4 | 121000232201011331030121 |
5 | 103404224233142023001 |
6 | 1025541451245210013 |
7 | 32112214024354014 |
oct | 3100564105751431 |
9 | 472430074367110 |
10 | 110001110111001 |
11 | 32060232a30aaa |
12 | 10406b51260909 |
13 | 494c0a2282385 |
14 | 1d2412155237b |
15 | cab5abde4586 |
hex | 640ba117d319 |
110001110111001 has 48 divisors (see below), whose sum is σ = 163413385873920. Its totient is φ = 71252192816640.
The previous prime is 110001110110943. The next prime is 110001110111051. The reversal of 110001110111001 is 100111011100011.
It is not a de Polignac number, because 110001110111001 - 26 = 110001110110937 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (110001110111051) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 860913946 + ... + 861041708.
It is an arithmetic number, because the mean of its divisors is an integer number (3404445539040).
Almost surely, 2110001110111001 is an apocalyptic number.
It is an amenable number.
110001110111001 is a deficient number, since it is larger than the sum of its proper divisors (53412275762919).
110001110111001 is a wasteful number, since it uses less digits than its factorization.
110001110111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131406 (or 131403 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 110001110111001 its reverse (100111011100011), we get a palindrome (210112121211012).
The spelling of 110001110111001 in words is "one hundred ten trillion, one billion, one hundred ten million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •