Base | Representation |
---|---|
bin | 1111101110100011010… |
… | …00010110000100000001 |
3 | 1220122211120012221112202 |
4 | 13313101220112010001 |
5 | 32323203302120043 |
6 | 1052130100402545 |
7 | 54020213404466 |
oct | 7672150260401 |
9 | 1818746187482 |
10 | 540387926273 |
11 | 1991a4995268 |
12 | 888929a6455 |
13 | 3bc5c6a51c0 |
14 | 1c22513166d |
15 | e0cb6e61b8 |
hex | 7dd1a16101 |
540387926273 has 16 divisors (see below), whose sum is σ = 589732558800. Its totient is φ = 492192184320.
The previous prime is 540387926269. The next prime is 540387926327. The reversal of 540387926273 is 372629783045.
It can be written as a sum of positive squares in 8 ways, for example, as 17994344449 + 522393581824 = 134143^2 + 722768^2 .
It is a cyclic number.
It is not a de Polignac number, because 540387926273 - 22 = 540387926269 is a prime.
It is a super-2 number, since 2×5403879262732 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (540387926473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 449708 + ... + 1132701.
It is an arithmetic number, because the mean of its divisors is an integer number (36858284925).
Almost surely, 2540387926273 is an apocalyptic number.
It is an amenable number.
540387926273 is a deficient number, since it is larger than the sum of its proper divisors (49344632527).
540387926273 is a wasteful number, since it uses less digits than its factorization.
540387926273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1582772.
The product of its (nonzero) digits is 15240960, while the sum is 56.
The spelling of 540387926273 in words is "five hundred forty billion, three hundred eighty-seven million, nine hundred twenty-six thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •