Base | Representation |
---|---|
bin | 110001000010100001… |
… | …1010100001111010000 |
3 | 101001211100002011121011 |
4 | 1202011003110033100 |
5 | 3211134213013120 |
6 | 120213541540304 |
7 | 10415500406413 |
oct | 1420503241720 |
9 | 331740064534 |
10 | 105311454160 |
11 | 40731630240 |
12 | 184b0714694 |
13 | 9c14049823 |
14 | 5150637b7a |
15 | 2b156b3c5a |
hex | 18850d43d0 |
105311454160 has 160 divisors (see below), whose sum is σ = 268884540288. Its totient is φ = 38041436160.
The previous prime is 105311454133. The next prime is 105311454181. The reversal of 105311454160 is 61454113501.
It is a super-2 number, since 2×1053114541602 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 119265079 + ... + 119265961.
Almost surely, 2105311454160 is an apocalyptic number.
105311454160 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 105311454160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134442270144).
105311454160 is an abundant number, since it is smaller than the sum of its proper divisors (163573086128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105311454160 is a wasteful number, since it uses less digits than its factorization.
105311454160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1653 (or 1647 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 105311454160 its reverse (61454113501), we get a palindrome (166765567661).
The spelling of 105311454160 in words is "one hundred five billion, three hundred eleven million, four hundred fifty-four thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •