Base | Representation |
---|---|
bin | 100100100001110101001… |
… | …0101101010110001100100 |
3 | 122202221200000200222122012 |
4 | 1021003222111222301210 |
5 | 1124223342024204000 |
6 | 14402210414453352 |
7 | 1025500341241460 |
oct | 111035225526144 |
9 | 18687600628565 |
10 | 5020453350500 |
11 | 1666187040515 |
12 | 690bb7804258 |
13 | 2a557166c923 |
14 | 134dc3d5d4a0 |
15 | 8a8d818d735 |
hex | 490ea56ac64 |
5020453350500 has 48 divisors (see below), whose sum is σ = 12531051571584. Its totient is φ = 1721298290400.
The previous prime is 5020453350487. The next prime is 5020453350509. The reversal of 5020453350500 is 50533540205.
It is not an unprimeable number, because it can be changed into a prime (5020453350509) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 717204122 + ... + 717211121.
It is an arithmetic number, because the mean of its divisors is an integer number (261063574408).
Almost surely, 25020453350500 is an apocalyptic number.
5020453350500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5020453350500 is an abundant number, since it is smaller than the sum of its proper divisors (7510598221084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5020453350500 is a wasteful number, since it uses less digits than its factorization.
5020453350500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1434415269 (or 1434415257 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 32.
Adding to 5020453350500 its reverse (50533540205), we get a palindrome (5070986890705).
The spelling of 5020453350500 in words is "five trillion, twenty billion, four hundred fifty-three million, three hundred fifty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •