Base | Representation |
---|---|
bin | 10010110110101101… |
… | …10110000010000000 |
3 | 222010110112212220220 |
4 | 21123112312002000 |
5 | 131212344242403 |
6 | 4352243303040 |
7 | 505564050222 |
oct | 113326660200 |
9 | 28113485826 |
10 | 10122649728 |
11 | 4324a76624 |
12 | 1b6607aa80 |
13 | c54231489 |
14 | 6c056c412 |
15 | 3e3a38953 |
hex | 25b5b6080 |
10122649728 has 128 divisors (see below), whose sum is σ = 29388925440. Its totient is φ = 3073228800.
The previous prime is 10122649687. The next prime is 10122649729. The reversal of 10122649728 is 82794622101.
It is a tau number, because it is divible by the number of its divisors (128).
It is a self number, because there is not a number n which added to its sum of digits gives 10122649728.
It is not an unprimeable number, because it can be changed into a prime (10122649729) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 177358 + ... + 227378.
It is an arithmetic number, because the mean of its divisors is an integer number (229600980).
Almost surely, 210122649728 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 10122649728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14694462720).
10122649728 is an abundant number, since it is smaller than the sum of its proper divisors (19266275712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122649728 is a wasteful number, since it uses less digits than its factorization.
10122649728 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50086 (or 50074 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 42.
The spelling of 10122649728 in words is "ten billion, one hundred twenty-two million, six hundred forty-nine thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •