Base | Representation |
---|---|
bin | 10011101001101010… |
… | …10010001111100000 |
3 | 1000020020210120120222 |
4 | 21310311102033200 |
5 | 133101303410000 |
6 | 4502512222212 |
7 | 522304013264 |
oct | 116465221740 |
9 | 30206716528 |
10 | 10550060000 |
11 | 4524263257 |
12 | 206523a968 |
13 | cc194c06c |
14 | 72122a0a4 |
15 | 41b313a85 |
hex | 274d523e0 |
10550060000 has 120 divisors (see below), whose sum is σ = 26250784560. Its totient is φ = 4171904000.
The previous prime is 10550059981. The next prime is 10550060033. The reversal of 10550060000 is 6005501.
It is a super-2 number, since 2×105500600002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1777037 + ... + 1782963.
It is an arithmetic number, because the mean of its divisors is an integer number (218756538).
Almost surely, 210550060000 is an apocalyptic number.
10550060000 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 10550060000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13125392280).
10550060000 is an abundant number, since it is smaller than the sum of its proper divisors (15700724560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10550060000 is an frugal number, since it uses more digits than its factorization.
10550060000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6046 (or 6023 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 17.
Adding to 10550060000 its reverse (6005501), we get a palindrome (10556065501).
The spelling of 10550060000 in words is "ten billion, five hundred fifty million, sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •