Base | Representation |
---|---|
bin | 100101000111010101110… |
… | …0110001101001111100000 |
3 | 200001122120211000211122211 |
4 | 1022032223212031033200 |
5 | 1132033324301200000 |
6 | 14503211442211504 |
7 | 1034351442642265 |
oct | 112165346151740 |
9 | 20048524024584 |
10 | 5101005100000 |
11 | 169736243a117 |
12 | 6a4738353b94 |
13 | 2b003aba8324 |
14 | 138c660c126c |
15 | 8ca4ece87ba |
hex | 4a3ab98d3e0 |
5101005100000 has 72 divisors (see below), whose sum is σ = 12552451576056. Its totient is φ = 2040402000000.
The previous prime is 5101005099929. The next prime is 5101005100001. The reversal of 5101005100000 is 15001015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5101005100001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25405026 + ... + 25605025.
It is an arithmetic number, because the mean of its divisors is an integer number (174339605223).
Almost surely, 25101005100000 is an apocalyptic number.
5101005100000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5101005100000 is an abundant number, since it is smaller than the sum of its proper divisors (7451446476056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5101005100000 is an frugal number, since it uses more digits than its factorization.
5101005100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51010086 (or 51010058 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 13.
The spelling of 5101005100000 in words is "five trillion, one hundred one billion, five million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •