Base | Representation |
---|---|
bin | 10010101000100110… |
… | …11000000101100010 |
3 | 221211012212002210110 |
4 | 21110103120011202 |
5 | 130442100101010 |
6 | 4332414512150 |
7 | 502626101526 |
oct | 112423300542 |
9 | 27735762713 |
10 | 10004300130 |
11 | 4274191840 |
12 | 1b32505656 |
13 | c35864826 |
14 | 6ac961d86 |
15 | 3d845c120 |
hex | 2544d8162 |
10004300130 has 128 divisors (see below), whose sum is σ = 27151407360. Its totient is φ = 2337776640.
The previous prime is 10004300113. The next prime is 10004300153. The reversal of 10004300130 is 3100340001.
It is a super-2 number, since 2×100043001302 (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, 1327132 + ... + 1334648.
It is an arithmetic number, because the mean of its divisors is an integer number (212120370).
Almost surely, 210004300130 is an apocalyptic number.
10004300130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10004300130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13575703680).
10004300130 is an abundant number, since it is smaller than the sum of its proper divisors (17147107230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10004300130 is a wasteful number, since it uses less digits than its factorization.
10004300130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7684.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 10004300130 its reverse (3100340001), we get a palindrome (13104640131).
The spelling of 10004300130 in words is "ten billion, four million, three hundred thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •