Base | Representation |
---|---|
bin | 1111101110011010101… |
… | …11010011011001010001 |
3 | 1220122122120112111101220 |
4 | 13313031113103121101 |
5 | 32323031441200113 |
6 | 1052115022315253 |
7 | 54015354124425 |
oct | 7671527233121 |
9 | 1818576474356 |
10 | 540316350033 |
11 | 199168547a49 |
12 | 88872a28b29 |
13 | 3bc4a9040b5 |
14 | 1c21981cb85 |
15 | e0c52a8523 |
hex | 7dcd5d3651 |
540316350033 has 32 divisors (see below), whose sum is σ = 751901356800. Its totient is φ = 344705846016.
The previous prime is 540316350029. The next prime is 540316350043. The reversal of 540316350033 is 330053613045.
It is a happy number.
It is not a de Polignac number, because 540316350033 - 22 = 540316350029 is a prime.
It is a super-2 number, since 2×5403163500332 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 540316349976 and 540316350003.
It is not an unprimeable number, because it can be changed into a prime (540316350043) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 4447623 + ... + 4567491.
It is an arithmetic number, because the mean of its divisors is an integer number (23496917400).
Almost surely, 2540316350033 is an apocalyptic number.
It is an amenable number.
540316350033 is a deficient number, since it is larger than the sum of its proper divisors (211585006767).
540316350033 is a wasteful number, since it uses less digits than its factorization.
540316350033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120361.
The product of its (nonzero) digits is 48600, while the sum is 33.
Adding to 540316350033 its reverse (330053613045), we get a palindrome (870369963078).
The spelling of 540316350033 in words is "five hundred forty billion, three hundred sixteen million, three hundred fifty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •