Base | Representation |
---|---|
bin | 10010101011110000… |
… | …00010000101001100 |
3 | 221220001111200010220 |
4 | 21111320002011030 |
5 | 131020323432130 |
6 | 4335200231340 |
7 | 503366300040 |
oct | 112570020514 |
9 | 27801450126 |
10 | 10030686540 |
11 | 4288074296 |
12 | 1b3b30b550 |
13 | c3b172aa4 |
14 | 6b2270020 |
15 | 3da920410 |
hex | 255e0214c |
10030686540 has 192 divisors, whose sum is σ = 33021542400. Its totient is φ = 2227357440.
The previous prime is 10030686539. The next prime is 10030686551. The reversal of 10030686540 is 4568603001.
It is a super-2 number, since 2×100306865402 (a number of 21 digits) contains 22 as substring.
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 63 ways as a sum of consecutive naturals, for example, 3592545 + ... + 3595335.
It is an arithmetic number, because the mean of its divisors is an integer number (171987200).
Almost surely, 210030686540 is an apocalyptic number.
10030686540 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 10030686540, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16510771200).
10030686540 is an abundant number, since it is smaller than the sum of its proper divisors (22990855860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10030686540 is a wasteful number, since it uses less digits than its factorization.
10030686540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3052 (or 3050 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
The spelling of 10030686540 in words is "ten billion, thirty million, six hundred eighty-six thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •