Base | Representation |
---|---|
bin | 10011100011110100… |
… | …10111011000100000 |
3 | 1000002211121010101220 |
4 | 21301322113120200 |
5 | 133001232411003 |
6 | 4454002055040 |
7 | 521140352436 |
oct | 116172273040 |
9 | 30084533356 |
10 | 10501060128 |
11 | 44a9635999 |
12 | 205094a480 |
13 | cb4753c60 |
14 | 718912d56 |
15 | 416d85353 |
hex | 271e97620 |
10501060128 has 48 divisors (see below), whose sum is σ = 29685692736. Its totient is φ = 3231095040.
The previous prime is 10501060127. The next prime is 10501060153. The reversal of 10501060128 is 82106010501.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×105010601282 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 10501060098 and 10501060107.
It is not an unprimeable number, because it can be changed into a prime (10501060121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4205908 + ... + 4208403.
It is an arithmetic number, because the mean of its divisors is an integer number (618451932).
Almost surely, 210501060128 is an apocalyptic number.
It is an amenable number.
10501060128 is an abundant number, since it is smaller than the sum of its proper divisors (19184632608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10501060128 is a wasteful number, since it uses less digits than its factorization.
10501060128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8414337 (or 8414329 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 24.
Adding to 10501060128 its reverse (82106010501), we get a palindrome (92607070629).
The spelling of 10501060128 in words is "ten billion, five hundred one million, sixty thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •