Base | Representation |
---|---|
bin | 10000000001110001001… |
… | …110001010000000000000 |
3 | 10220021221020102100001000 |
4 | 100001301032022000000 |
5 | 121021142224223120 |
6 | 2201551543412000 |
7 | 142400665265526 |
oct | 20016116120000 |
9 | 3807836370030 |
10 | 1101411164160 |
11 | 39511898556a |
12 | 159564454000 |
13 | 7cb2a265458 |
14 | 3b446a84316 |
15 | 1d9b47ed990 |
hex | 1007138a000 |
1101411164160 has 1792 divisors, whose sum is σ = 4484276121600. Its totient is φ = 255058771968.
The previous prime is 1101411164149. The next prime is 1101411164237. The reversal of 1101411164160 is 614611141011.
1101411164160 is a `hidden beast` number, since 1 + 1 + 0 + 1 + 4 + 1 + 11 + 641 + 6 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 20781342694 + ... + 20781342746.
Almost surely, 21101411164160 is an apocalyptic number.
1101411164160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1101411164160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2242138060800).
1101411164160 is an abundant number, since it is smaller than the sum of its proper divisors (3382864957440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101411164160 is a wasteful number, since it uses less digits than its factorization.
1101411164160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 178 (or 148 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 27.
The spelling of 1101411164160 in words is "one trillion, one hundred one billion, four hundred eleven million, one hundred sixty-four thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •