Base | Representation |
---|---|
bin | 1111101110010100000… |
… | …01111011101010000101 |
3 | 1220122111200021202111222 |
4 | 13313022001323222011 |
5 | 32322423131304013 |
6 | 1052105303410125 |
7 | 54014104524014 |
oct | 7671201735205 |
9 | 1818450252458 |
10 | 540260416133 |
11 | 199139a13a89 |
12 | 88858153945 |
13 | 3bc3c14bb09 |
14 | 1c21221ca7b |
15 | e0c040a508 |
hex | 7dca07ba85 |
540260416133 has 4 divisors (see below), whose sum is σ = 540262200768. Its totient is φ = 540258631500.
The previous prime is 540260416097. The next prime is 540260416141. The reversal of 540260416133 is 331614062045.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 540260416133 - 218 = 540260153989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 540260416093 and 540260416102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (540260410133) 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, 312743 + ... + 1085508.
It is an arithmetic number, because the mean of its divisors is an integer number (135065550192).
Almost surely, 2540260416133 is an apocalyptic number.
It is an amenable number.
540260416133 is a deficient number, since it is larger than the sum of its proper divisors (1784635).
540260416133 is a wasteful number, since it uses less digits than its factorization.
540260416133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1784634.
The product of its (nonzero) digits is 51840, while the sum is 35.
Adding to 540260416133 its reverse (331614062045), we get a palindrome (871874478178).
The spelling of 540260416133 in words is "five hundred forty billion, two hundred sixty million, four hundred sixteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •