Base | Representation |
---|---|
bin | 1011000111111011001… |
… | …1111110111101000000 |
3 | 200021021111212122020122 |
4 | 2301332303332331000 |
5 | 11112341131224230 |
6 | 223443135155412 |
7 | 16543534124150 |
oct | 2617663767500 |
9 | 607244778218 |
10 | 191106117440 |
11 | 7405846a637 |
12 | 31055075b68 |
13 | 15037844c84 |
14 | 936cc10760 |
15 | 4e87759be5 |
hex | 2c7ecfef40 |
191106117440 has 112 divisors (see below), whose sum is σ = 550674796032. Its totient is φ = 61667844096.
The previous prime is 191106117413. The next prime is 191106117481. The reversal of 191106117440 is 44711601191.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 191106117440.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 2471192 + ... + 2547351.
Almost surely, 2191106117440 is an apocalyptic number.
191106117440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
191106117440 is an abundant number, since it is smaller than the sum of its proper divisors (359568678592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
191106117440 is a wasteful number, since it uses less digits than its factorization.
191106117440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5018584 (or 5018574 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 35.
The spelling of 191106117440 in words is "one hundred ninety-one billion, one hundred six million, one hundred seventeen thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •