Base | Representation |
---|---|
bin | 100101100001101000000… |
… | …1111010101100010010100 |
3 | 200021001021212102020202111 |
4 | 1023003100033111202110 |
5 | 1133444431313432000 |
6 | 14545145111320404 |
7 | 1041420346250332 |
oct | 113032017254224 |
9 | 20231255366674 |
10 | 5157454436500 |
11 | 170929a636133 |
12 | 6b3671080104 |
13 | 2b5465b3a7a2 |
14 | 13b89d188b52 |
15 | 8e255982cba |
hex | 4b0d03d5894 |
5157454436500 has 48 divisors (see below), whose sum is σ = 11264971522896. Its totient is φ = 2062781952000.
The previous prime is 5157454436489. The next prime is 5157454436503. The reversal of 5157454436500 is 56344547515.
It can be written as a sum of positive squares in 8 ways, for example, as 790708651524 + 4366745784976 = 889218^2 + 2089676^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5157454436503) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4722160 + ... + 5710840.
It is an arithmetic number, because the mean of its divisors is an integer number (234686906727).
Almost surely, 25157454436500 is an apocalyptic number.
5157454436500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5157454436500 is an abundant number, since it is smaller than the sum of its proper divisors (6107517086396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5157454436500 is a wasteful number, since it uses less digits than its factorization.
5157454436500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 999133 (or 999121 counting only the distinct ones).
The product of its (nonzero) digits is 5040000, while the sum is 49.
The spelling of 5157454436500 in words is "five trillion, one hundred fifty-seven billion, four hundred fifty-four million, four hundred thirty-six thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •