Base | Representation |
---|---|
bin | 10010110110101000… |
… | …11001000000001100 |
3 | 222010102100012122010 |
4 | 21123110121000030 |
5 | 131212213202130 |
6 | 4352221421220 |
7 | 505555431102 |
oct | 113324310014 |
9 | 28112305563 |
10 | 10122006540 |
11 | 4324677368 |
12 | 1b65a0a810 |
13 | c540677a9 |
14 | 6c0441c72 |
15 | 3e395d0b0 |
hex | 25b51900c |
10122006540 has 96 divisors (see below), whose sum is σ = 29349863424. Its totient is φ = 2603738880.
The previous prime is 10122006539. The next prime is 10122006563. The reversal of 10122006540 is 4560022101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 581037 + ... + 598203.
It is an arithmetic number, because the mean of its divisors is an integer number (305727744).
Almost surely, 210122006540 is an apocalyptic number.
10122006540 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 10122006540, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14674931712).
10122006540 is an abundant number, since it is smaller than the sum of its proper divisors (19227856884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122006540 is a wasteful number, since it uses less digits than its factorization.
10122006540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17527 (or 17525 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 10122006540 its reverse (4560022101), we get a palindrome (14682028641).
The spelling of 10122006540 in words is "ten billion, one hundred twenty-two million, six thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •