Base | Representation |
---|---|
bin | 111101011001010100110110… |
… | …1001101100010011101010000 |
3 | 2121211010112220111021120220022 |
4 | 1322302221231031202131100 |
5 | 1031241023344103130000 |
6 | 5152324022323003012 |
7 | 221515530600255350 |
oct | 17262515515423520 |
9 | 2554115814246808 |
10 | 540042430130000 |
11 | 14708a787a27586 |
12 | 5069ba11209468 |
13 | 1a244a23618845 |
14 | 975029bb66b60 |
15 | 4267b2262a585 |
hex | 1eb2a6d362750 |
540042430130000 has 100 divisors (see below), whose sum is σ = 1494281974579680. Its totient is φ = 185157404592000.
The previous prime is 540042430129981. The next prime is 540042430130009. The reversal of 540042430130000 is 31034240045.
It is a tau number, because it is divible by the number of its divisors (100).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (540042430130009) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 3857375930 + ... + 3857515929.
Almost surely, 2540042430130000 is an apocalyptic number.
540042430130000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
540042430130000 is an abundant number, since it is smaller than the sum of its proper divisors (954239544449680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
540042430130000 is an equidigital number, since it uses as much as digits as its factorization.
540042430130000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7714891894 (or 7714891873 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 26.
Adding to 540042430130000 its reverse (31034240045), we get a palindrome (540073464370045).
The spelling of 540042430130000 in words is "five hundred forty trillion, forty-two billion, four hundred thirty million, one hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •