Base | Representation |
---|---|
bin | 10010110100101011… |
… | …00111011011000000 |
3 | 222002021101011020012 |
4 | 21122111213123000 |
5 | 131144010104103 |
6 | 4350433004052 |
7 | 505265522303 |
oct | 113225473300 |
9 | 28067334205 |
10 | 10105550528 |
11 | 4316357757 |
12 | 1b603b3628 |
13 | c508254c8 |
14 | 6bc19ab3a |
15 | 3e22ac2d8 |
hex | 25a5676c0 |
10105550528 has 56 divisors (see below), whose sum is σ = 20275003392. Its totient is φ = 4997147904.
The previous prime is 10105550513. The next prime is 10105550579. The reversal of 10105550528 is 82505550101.
It is a super-2 number, since 2×101055505282 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 10105550494 and 10105550503.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2818625 + ... + 2822207.
It is an arithmetic number, because the mean of its divisors is an integer number (362053632).
Almost surely, 210105550528 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 10105550528, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10137501696).
10105550528 is an abundant number, since it is smaller than the sum of its proper divisors (10169452864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10105550528 is a wasteful number, since it uses less digits than its factorization.
10105550528 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4069 (or 4059 counting only the distinct ones).
The product of its (nonzero) digits is 10000, while the sum is 32.
The spelling of 10105550528 in words is "ten billion, one hundred five million, five hundred fifty thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •