Base | Representation |
---|---|
bin | 110000010001100100… |
… | …0100110110000000000 |
3 | 100220120211220021020100 |
4 | 1200203020212300000 |
5 | 3144303140023121 |
6 | 115342535242400 |
7 | 10330002120501 |
oct | 1404310466000 |
9 | 326524807210 |
10 | 103668673536 |
11 | 3aa692998aa |
12 | 18112519400 |
13 | 9a118b569c |
14 | 50363a8ba8 |
15 | 2a6b364026 |
hex | 1823226c00 |
103668673536 has 264 divisors, whose sum is σ = 314897117184. Its totient is φ = 32784998400.
The previous prime is 103668673519. The next prime is 103668673543. The reversal of 103668673536 is 635376866301.
It is a happy number.
103668673536 is a `hidden beast` number, since 1 + 0 + 36 + 6 + 8 + 6 + 73 + 536 = 666.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 26918011 + ... + 26921861.
Almost surely, 2103668673536 is an apocalyptic number.
103668673536 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 103668673536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157448558592).
103668673536 is an abundant number, since it is smaller than the sum of its proper divisors (211228443648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103668673536 is a wasteful number, since it uses less digits than its factorization.
103668673536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4027 (or 4006 counting only the distinct ones).
The product of its (nonzero) digits is 9797760, while the sum is 54.
The spelling of 103668673536 in words is "one hundred three billion, six hundred sixty-eight million, six hundred seventy-three thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •