Base | Representation |
---|---|
bin | 1111101101111011011… |
… | …01000100010100111111 |
3 | 1220121222021011102121002 |
4 | 13312331231010110333 |
5 | 32322012211320111 |
6 | 1052032555200515 |
7 | 54006014012642 |
oct | 7667555042477 |
9 | 1817867142532 |
10 | 540053620031 |
11 | 19904320a012 |
12 | 887baa4613b |
13 | 3bc08355363 |
14 | 1c1d298ba59 |
15 | e0ac1ac63b |
hex | 7dbdb4453f |
540053620031 has 4 divisors (see below), whose sum is σ = 540490204632. Its totient is φ = 539617035432.
The previous prime is 540053620019. The next prime is 540053620037. The reversal of 540053620031 is 130026350045.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 540053620031 - 26 = 540053619967 is a prime.
It is a super-2 number, since 2×5400536200312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 540053619976 and 540053620003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (540053620037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 218290445 + ... + 218292918.
It is an arithmetic number, because the mean of its divisors is an integer number (135122551158).
Almost surely, 2540053620031 is an apocalyptic number.
540053620031 is a deficient number, since it is larger than the sum of its proper divisors (436584601).
540053620031 is a wasteful number, since it uses less digits than its factorization.
540053620031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 436584600.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 540053620031 its reverse (130026350045), we get a palindrome (670079970076).
The spelling of 540053620031 in words is "five hundred forty billion, fifty-three million, six hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •