Base | Representation |
---|---|
bin | 10011110100110000… |
… | …00010000111101000 |
3 | 1000110201210012212012 |
4 | 21322120002013220 |
5 | 133244110230310 |
6 | 4520033335052 |
7 | 524513322050 |
oct | 117230020750 |
9 | 30421705765 |
10 | 10643055080 |
11 | 45717aa899 |
12 | 2090407488 |
13 | 1007cac338 |
14 | 72d716560 |
15 | 424582c05 |
hex | 27a6021e8 |
10643055080 has 128 divisors (see below), whose sum is σ = 27962496000. Its totient is φ = 3570158592.
The previous prime is 10643055077. The next prime is 10643055097. The reversal of 10643055080 is 8055034601.
It is a happy number.
It is a super-2 number, since 2×106430550802 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6870146 + ... + 6871694.
It is an arithmetic number, because the mean of its divisors is an integer number (218457000).
Almost surely, 210643055080 is an apocalyptic number.
10643055080 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 10643055080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13981248000).
10643055080 is an abundant number, since it is smaller than the sum of its proper divisors (17319440920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10643055080 is a wasteful number, since it uses less digits than its factorization.
10643055080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2083 (or 2079 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 10643055080 its reverse (8055034601), we get a palindrome (18698089681).
The spelling of 10643055080 in words is "ten billion, six hundred forty-three million, fifty-five thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •