Base | Representation |
---|---|
bin | 110000010001001110… |
… | …0010000001010001000 |
3 | 100220120001000120011110 |
4 | 1200202130100022020 |
5 | 3144242200443124 |
6 | 115341442130320 |
7 | 10326501234063 |
oct | 1404234201210 |
9 | 326501016143 |
10 | 103657046664 |
11 | 3aa62778416 |
12 | 1810a6509a0 |
13 | 9a0c374492 |
14 | 5034a1d8da |
15 | 2a6a319029 |
hex | 1822710288 |
103657046664 has 64 divisors (see below), whose sum is σ = 264784608000. Its totient is φ = 33805638720.
The previous prime is 103657046657. The next prime is 103657046671. The reversal of 103657046664 is 466640756301.
It is an interprime number because it is at equal distance from previous prime (103657046657) and next prime (103657046671).
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 15 ways as a sum of consecutive naturals, for example, 125307 + ... + 472245.
It is an arithmetic number, because the mean of its divisors is an integer number (4137259500).
Almost surely, 2103657046664 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 103657046664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132392304000).
103657046664 is an abundant number, since it is smaller than the sum of its proper divisors (161127561336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103657046664 is a wasteful number, since it uses less digits than its factorization.
103657046664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347218 (or 347214 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 48.
The spelling of 103657046664 in words is "one hundred three billion, six hundred fifty-seven million, forty-six thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •