Base | Representation |
---|---|
bin | 110000111101010001… |
… | …0011111100000000000 |
3 | 101001101001012022010200 |
4 | 1201322202133200000 |
5 | 3210304034434001 |
6 | 120144241325200 |
7 | 10411226261400 |
oct | 1417242374000 |
9 | 331331168120 |
10 | 105135077376 |
11 | 406510127aa |
12 | 18461636800 |
13 | 9bb6643b74 |
14 | 5135044800 |
15 | 2b04e74086 |
hex | 187a89f800 |
105135077376 has 432 divisors, whose sum is σ = 359393743800. Its totient is φ = 29514498048.
The previous prime is 105135077329. The next prime is 105135077381. The reversal of 105135077376 is 673770531501.
105135077376 is a `hidden beast` number, since 1 + 0 + 5 + 1 + 3 + 507 + 73 + 76 = 666.
It is a super-2 number, since 2×1051350773762 (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 35 ways as a sum of consecutive naturals, for example, 53285926 + ... + 53287898.
Almost surely, 2105135077376 is an apocalyptic number.
105135077376 is a gapful number since it is divisible by the number (16) 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 105135077376, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (179696871900).
105135077376 is an abundant number, since it is smaller than the sum of its proper divisors (254258666424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105135077376 is a wasteful number, since it uses less digits than its factorization.
105135077376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2074 (or 2044 counting only the distinct ones).
The product of its (nonzero) digits is 463050, while the sum is 45.
The spelling of 105135077376 in words is "one hundred five billion, one hundred thirty-five million, seventy-seven thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •