Base | Representation |
---|---|
bin | 111101011001010000100100… |
… | …0111110111111001011001111 |
3 | 2121211002200011111010112211111 |
4 | 1322302201020332333023033 |
5 | 1031240401024443313403 |
6 | 5152315501515432451 |
7 | 221515053633666250 |
oct | 17262411076771317 |
9 | 2554080144115744 |
10 | 540033232401103 |
11 | 147086898064741 |
12 | 5069a084a55727 |
13 | 1a243bb8bc7bcc |
14 | 974da683a0b27 |
15 | 4267784de256d |
hex | 1eb2848fbf2cf |
540033232401103 has 32 divisors (see below), whose sum is σ = 643668227136000. Its totient is φ = 443467890302976.
The previous prime is 540033232401101. The next prime is 540033232401139. The reversal of 540033232401103 is 301104232330045.
It is a happy number.
It is not a de Polignac number, because 540033232401103 - 21 = 540033232401101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (540033232401101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25889226 + ... + 41836807.
It is an arithmetic number, because the mean of its divisors is an integer number (20114632098000).
Almost surely, 2540033232401103 is an apocalyptic number.
540033232401103 is a deficient number, since it is larger than the sum of its proper divisors (103634994734897).
540033232401103 is a wasteful number, since it uses less digits than its factorization.
540033232401103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67726591.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 540033232401103 its reverse (301104232330045), we get a palindrome (841137464731148).
The spelling of 540033232401103 in words is "five hundred forty trillion, thirty-three billion, two hundred thirty-two million, four hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •