Base | Representation |
---|---|
bin | 110000010001110000… |
… | …1100001010110110000 |
3 | 100220121022012002202220 |
4 | 1200203201201112300 |
5 | 3144311323030130 |
6 | 115343331241040 |
7 | 10330111463001 |
oct | 1404341412660 |
9 | 326538162686 |
10 | 103675205040 |
11 | 3aa71a50040 |
12 | 18114749180 |
13 | 9a13061594 |
14 | 50371c91a8 |
15 | 2a6bc04410 |
hex | 18238615b0 |
103675205040 has 480 divisors, whose sum is σ = 365460823296. Its totient is φ = 24106199040.
The previous prime is 103675205027. The next prime is 103675205047. The reversal of 103675205040 is 40502576301.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 103675204992 and 103675205010.
It is not an unprimeable number, because it can be changed into a prime (103675205047) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 327050962 + ... + 327051278.
Almost surely, 2103675205040 is an apocalyptic number.
103675205040 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 103675205040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182730411648).
103675205040 is an abundant number, since it is smaller than the sum of its proper divisors (261785618256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103675205040 is a wasteful number, since it uses less digits than its factorization.
103675205040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 497 (or 448 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 33.
The spelling of 103675205040 in words is "one hundred three billion, six hundred seventy-five million, two hundred five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •