Base | Representation |
---|---|
bin | 100100011000100010101… |
… | …0110101101001000110100 |
3 | 122201001011211022211012101 |
4 | 1020301011112231020310 |
5 | 1123412013402400000 |
6 | 14345111151231444 |
7 | 1024163121355411 |
oct | 110610526551064 |
9 | 18631154284171 |
10 | 5000505512500 |
11 | 165877aaa9593 |
12 | 68916b218584 |
13 | 2a3712a294a4 |
14 | 134050975108 |
15 | 8a11bcc7e6a |
hex | 48c455ad234 |
5000505512500 has 36 divisors (see below), whose sum is σ = 10937905765164. Its totient is φ = 2000202200000.
The previous prime is 5000505512459. The next prime is 5000505512503. The reversal of 5000505512500 is 52155050005.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 4327747944976 + 672757567524 = 2080324^2 + 820218^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5000505512503) 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, 200007721 + ... + 200032720.
It is an arithmetic number, because the mean of its divisors is an integer number (303830715699).
Almost surely, 25000505512500 is an apocalyptic number.
5000505512500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5000505512500 is an abundant number, since it is smaller than the sum of its proper divisors (5937400252664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5000505512500 is an equidigital number, since it uses as much as digits as its factorization.
5000505512500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 400040470 (or 400040448 counting only the distinct ones).
The product of its (nonzero) digits is 6250, while the sum is 28.
The spelling of 5000505512500 in words is "five trillion, five hundred five million, five hundred twelve thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •