Base | Representation |
---|---|
bin | 10000111001010111110… |
… | …011110010100011001110 |
3 | 11010000001001112010122210 |
4 | 100321113303302203032 |
5 | 123010430234122420 |
6 | 2245224130251250 |
7 | 146613332152131 |
oct | 20712763624316 |
9 | 4100031463583 |
10 | 1161114364110 |
11 | 408475874328 |
12 | 169046a26b26 |
13 | 856533751bc |
14 | 402abd58218 |
15 | 2030ae759e0 |
hex | 10e57cf28ce |
1161114364110 has 16 divisors (see below), whose sum is σ = 2786674473936. Its totient is φ = 309630497088.
The previous prime is 1161114364103. The next prime is 1161114364171. The reversal of 1161114364110 is 114634111611.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 38703812137 = 1161114364110 / (1 + 1 + 6 + 1 + 1 + 1 + 4 + 3 + 6 + 4 + 1 + 1 + 0).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19351906039 + ... + 19351906098.
It is an arithmetic number, because the mean of its divisors is an integer number (174167154621).
Almost surely, 21161114364110 is an apocalyptic number.
1161114364110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1161114364110 is an abundant number, since it is smaller than the sum of its proper divisors (1625560109826).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1161114364110 is a wasteful number, since it uses less digits than its factorization.
1161114364110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38703812147.
The product of its (nonzero) digits is 1728, while the sum is 30.
Adding to 1161114364110 its reverse (114634111611), we get a palindrome (1275748475721).
The spelling of 1161114364110 in words is "one trillion, one hundred sixty-one billion, one hundred fourteen million, three hundred sixty-four thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •