Base | Representation |
---|---|
bin | 1111101101111010000… |
… | …01100001110001011100 |
3 | 1220121221110200112220022 |
4 | 13312331001201301130 |
5 | 32322001301100200 |
6 | 1052031510411312 |
7 | 54005515004522 |
oct | 7667501416134 |
9 | 1817843615808 |
10 | 540042206300 |
11 | 199037823783 |
12 | 887b7060b38 |
13 | 3bc05b8a17c |
14 | 1c1d125a312 |
15 | e0ab1a5885 |
hex | 7dbd061c5c |
540042206300 has 18 divisors (see below), whose sum is σ = 1171891587888. Its totient is φ = 216016882480.
The previous prime is 540042206243. The next prime is 540042206309. The reversal of 540042206300 is 3602240045.
It is a self number, because there is not a number n which added to its sum of digits gives 540042206300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (540042206309) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2700210932 + ... + 2700211131.
It is an arithmetic number, because the mean of its divisors is an integer number (65105088216).
Almost surely, 2540042206300 is an apocalyptic number.
540042206300 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
540042206300 is an abundant number, since it is smaller than the sum of its proper divisors (631849381588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
540042206300 is a wasteful number, since it uses less digits than its factorization.
540042206300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5400422077 (or 5400422070 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 26.
Adding to 540042206300 its reverse (3602240045), we get a palindrome (543644446345).
The spelling of 540042206300 in words is "five hundred forty billion, forty-two million, two hundred six thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •