Base | Representation |
---|---|
bin | 1001000110010111100010… |
… | …0010100010011111110100 |
3 | 1022102110122201210010022202 |
4 | 2101211320202202133310 |
5 | 2302410220243340000 |
6 | 33140122321044032 |
7 | 2051560153421654 |
oct | 221457042423764 |
9 | 38373581703282 |
10 | 10005001152500 |
11 | 3208108358a02 |
12 | 1157052786618 |
13 | 5776102cb863 |
14 | 26835d410364 |
15 | 1253be025dd5 |
hex | 919788a27f4 |
10005001152500 has 30 divisors (see below), whose sum is σ = 21878936525754. Its totient is φ = 4002000460000.
The previous prime is 10005001152479. The next prime is 10005001152521. The reversal of 10005001152500 is 525110050001.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10005001152479) and next prime (10005001152521).
It can be written as a sum of positive squares in 5 ways, for example, as 5000313155044 + 5004687997456 = 2236138^2 + 2237116^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 2000997731 + ... + 2001002730.
Almost surely, 210005001152500 is an apocalyptic number.
10005001152500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10005001152500 is an abundant number, since it is smaller than the sum of its proper divisors (11873935373254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10005001152500 is an equidigital number, since it uses as much as digits as its factorization.
10005001152500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4002000485 (or 4002000468 counting only the distinct ones).
The product of its (nonzero) digits is 250, while the sum is 20.
The spelling of 10005001152500 in words is "ten trillion, five billion, one million, one hundred fifty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •