Base | Representation |
---|---|
bin | 11101010000000011010… |
… | …11011011101010110000 |
3 | 10120002012200211220201222 |
4 | 32220001223123222300 |
5 | 112431320412310000 |
6 | 2045414104244212 |
7 | 132420042243665 |
oct | 16500153335260 |
9 | 3502180756658 |
10 | 1005050510000 |
11 | 35826a8a18a9 |
12 | 142951470668 |
13 | 73a117309b4 |
14 | 369050d5a6c |
15 | 1b224d48a85 |
hex | ea01adbab0 |
1005050510000 has 100 divisors (see below), whose sum is σ = 2433813292944. Its totient is φ = 401940000000.
The previous prime is 1005050509979. The next prime is 1005050510011. The reversal of 1005050510000 is 150505001.
It is a tau number, because it is divible by the number of its divisors (100).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 99004925 + ... + 99015075.
Almost surely, 21005050510000 is an apocalyptic number.
1005050510000 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 1005050510000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1216906646472).
1005050510000 is an abundant number, since it is smaller than the sum of its proper divisors (1428762782944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1005050510000 is an equidigital number, since it uses as much as digits as its factorization.
1005050510000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20080 (or 20059 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 17.
The spelling of 1005050510000 in words is "one trillion, five billion, fifty million, five hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •