Base | Representation |
---|---|
bin | 1111101110110110101… |
… | …10110011101101110100 |
3 | 1220200020221021002121021 |
4 | 13313123112303231310 |
5 | 32324022040220200 |
6 | 1052154210030524 |
7 | 54024234356440 |
oct | 7673326635564 |
9 | 1820227232537 |
10 | 540551101300 |
11 | 199279006061 |
12 | 88919578444 |
13 | 3bc87437b82 |
14 | 1c23ca89820 |
15 | e0dabc941a |
hex | 7ddb5b3b74 |
540551101300 has 144 divisors (see below), whose sum is σ = 1384368283648. Its totient is φ = 179281123200.
The previous prime is 540551101291. The next prime is 540551101333. The reversal of 540551101300 is 3101155045.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 97799137 + ... + 97804663.
Almost surely, 2540551101300 is an apocalyptic number.
540551101300 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 540551101300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (692184141824).
540551101300 is an abundant number, since it is smaller than the sum of its proper divisors (843817182348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
540551101300 is a wasteful number, since it uses less digits than its factorization.
540551101300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10086 (or 10079 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
Adding to 540551101300 its reverse (3101155045), we get a palindrome (543652256345).
The spelling of 540551101300 in words is "five hundred forty billion, five hundred fifty-one million, one hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •