Base | Representation |
---|---|
bin | 100111010100001101111… |
… | …1011001001110101110000 |
3 | 201010120110210211111100222 |
4 | 1032220123323021311300 |
5 | 1202012421030200000 |
6 | 15254203434232212 |
7 | 1065251456432666 |
oct | 116503373116560 |
9 | 21116423744328 |
10 | 5403537350000 |
11 | 17a3699a67309 |
12 | 7332a9885668 |
13 | 3027225184ca |
14 | 14976566ac36 |
15 | 95859953a85 |
hex | 4ea1bec9d70 |
5403537350000 has 120 divisors (see below), whose sum is σ = 13439530814976. Its totient is φ = 2102997600000.
The previous prime is 5403537349867. The next prime is 5403537350011. The reversal of 5403537350000 is 537353045.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 389585 + ... + 3310415.
Almost surely, 25403537350000 is an apocalyptic number.
5403537350000 is a gapful number since it is divisible by the number (50) 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 5403537350000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6719765407488).
5403537350000 is an abundant number, since it is smaller than the sum of its proper divisors (8035993464976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5403537350000 is an equidigital number, since it uses as much as digits as its factorization.
5403537350000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2920901 (or 2920875 counting only the distinct ones).
The product of its (nonzero) digits is 94500, while the sum is 35.
The spelling of 5403537350000 in words is "five trillion, four hundred three billion, five hundred thirty-seven million, three hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •