Base | Representation |
---|---|
bin | 1001000110101010001010… |
… | …0001100010011110000010 |
3 | 1022102221120010221022122212 |
4 | 2101222202201202132002 |
5 | 2303000440112004420 |
6 | 33142310350302122 |
7 | 2052125100242615 |
oct | 221524241423602 |
9 | 38387503838585 |
10 | 10010000500610 |
11 | 320a243360160 |
12 | 1158008ab7942 |
13 | 577c28c8c7c6 |
14 | 2686b538217c |
15 | 1255b2d9e3c5 |
hex | 91aa2862782 |
10010000500610 has 128 divisors (see below), whose sum is σ = 20877788123136. Its totient is φ = 3419895043840.
The previous prime is 10010000500601. The next prime is 10010000500613. The reversal of 10010000500610 is 1600500001001.
It is a super-2 number, since 2×100100005006102 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10010000500613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 36190499 + ... + 36466041.
It is an arithmetic number, because the mean of its divisors is an integer number (163107719712).
Almost surely, 210010000500610 is an apocalyptic number.
10010000500610 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10010000500610 is an abundant number, since it is smaller than the sum of its proper divisors (10867787622526).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010000500610 is a wasteful number, since it uses less digits than its factorization.
10010000500610 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275840.
The product of its (nonzero) digits is 30, while the sum is 14.
Adding to 10010000500610 its reverse (1600500001001), we get a palindrome (11610500501611).
The spelling of 10010000500610 in words is "ten trillion, ten billion, five hundred thousand, six hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •