Base | Representation |
---|---|
bin | 1001001100100010110110… |
… | …1101110110111101100101 |
3 | 1022210121120100010200121101 |
4 | 2103020231231312331211 |
5 | 2311130033210323414 |
6 | 33300552344320101 |
7 | 2062334660014255 |
oct | 223105555667545 |
9 | 38717510120541 |
10 | 10111120011109 |
11 | 3249113717047 |
12 | 1173729773031 |
13 | 5846226c15a0 |
14 | 26d548d7d965 |
15 | 128030525a74 |
hex | 9322db76f65 |
10111120011109 has 8 divisors (see below), whose sum is σ = 11461998393440. Its totient is φ = 8842113045936.
The previous prime is 10111120011079. The next prime is 10111120011131. The reversal of 10111120011109 is 90111002111101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10111120011109 - 231 = 10108972527461 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111120017109) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20467854027 + ... + 20467854520.
It is an arithmetic number, because the mean of its divisors is an integer number (1432749799180).
Almost surely, 210111120011109 is an apocalyptic number.
10111120011109 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
10111120011109 is a deficient number, since it is larger than the sum of its proper divisors (1350878382331).
10111120011109 is a wasteful number, since it uses less digits than its factorization.
10111120011109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40935708579.
The product of its (nonzero) digits is 18, while the sum is 19.
The spelling of 10111120011109 in words is "ten trillion, one hundred eleven billion, one hundred twenty million, eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •