Base | Representation |
---|---|
bin | 110000111001011010… |
… | …0001011011011000000 |
3 | 101001001000100212220110 |
4 | 1201302310023123000 |
5 | 3210022401333000 |
6 | 120123332111320 |
7 | 10405063663206 |
oct | 1416264133300 |
9 | 331030325813 |
10 | 105005496000 |
11 | 40594957359 |
12 | 18426165540 |
13 | 9b95843ab2 |
14 | 5121b53076 |
15 | 2ae88c9850 |
hex | 1872d0b6c0 |
105005496000 has 224 divisors, whose sum is σ = 347144279040. Its totient is φ = 27967872000.
The previous prime is 105005495993. The next prime is 105005496031. The reversal of 105005496000 is 694500501.
It is a super-2 number, since 2×1050054960002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 24933895 + ... + 24938105.
Almost surely, 2105005496000 is an apocalyptic number.
105005496000 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 105005496000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (173572139520).
105005496000 is an abundant number, since it is smaller than the sum of its proper divisors (242138783040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105005496000 is a wasteful number, since it uses less digits than its factorization.
105005496000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5280 (or 5260 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 30.
Adding to 105005496000 its reverse (694500501), we get a palindrome (105699996501).
The spelling of 105005496000 in words is "one hundred five billion, five million, four hundred ninety-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •