Base | Representation |
---|---|
bin | 110000000011111000… |
… | …0101110011011010000 |
3 | 100212101211202012201220 |
4 | 1200013300232123100 |
5 | 3142333103204223 |
6 | 115225212125040 |
7 | 10312424445312 |
oct | 1400760563320 |
9 | 325354665656 |
10 | 103209428688 |
11 | 3a853039403 |
12 | 18004766780 |
13 | 996a6cca82 |
14 | 4dd13c17b2 |
15 | 2a40d9b6e3 |
hex | 1807c2e6d0 |
103209428688 has 160 divisors (see below), whose sum is σ = 285356307456. Its totient is φ = 32030982144.
The previous prime is 103209428681. The next prime is 103209428723. The reversal of 103209428688 is 886824902301.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 103209428688.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103209428681) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 79574856 + ... + 79576152.
Almost surely, 2103209428688 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 103209428688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142678153728).
103209428688 is an abundant number, since it is smaller than the sum of its proper divisors (182146878768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103209428688 is a wasteful number, since it uses less digits than its factorization.
103209428688 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2301 (or 2295 counting only the distinct ones).
The product of its (nonzero) digits is 1327104, while the sum is 51.
The spelling of 103209428688 in words is "one hundred three billion, two hundred nine million, four hundred twenty-eight thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •