Base | Representation |
---|---|
bin | 10101001111101101110… |
… | …101001100000111100101 |
3 | 12011120110210120121021101 |
4 | 111033231311030013211 |
5 | 142410021404304210 |
6 | 3034412445120101 |
7 | 210323523503101 |
oct | 25175565140745 |
9 | 5146423517241 |
10 | 1459984056805 |
11 | 5131a2a35a5a |
12 | 1b6b55859031 |
13 | a78a2c71301 |
14 | 50940d0c901 |
15 | 27e9e2b3a3a |
hex | 153edd4c1e5 |
1459984056805 has 32 divisors (see below), whose sum is σ = 1788743800800. Its totient is φ = 1143741468672.
The previous prime is 1459984056787. The next prime is 1459984056863. The reversal of 1459984056805 is 5086504899541.
It is a Cunningham number, because it is equal to 12082982+1.
It can be written as a sum of positive squares in 16 ways, for example, as 182528036289 + 1277456020516 = 427233^2 + 1130246^2 .
It is a cyclic number.
It is not a de Polignac number, because 1459984056805 - 27 = 1459984056677 is a prime.
It is a super-2 number, since 2×14599840568052 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 130618377 + ... + 130629553.
It is an arithmetic number, because the mean of its divisors is an integer number (55898243775).
Almost surely, 21459984056805 is an apocalyptic number.
It is an amenable number.
1459984056805 is a deficient number, since it is larger than the sum of its proper divisors (328759743995).
1459984056805 is a wasteful number, since it uses less digits than its factorization.
1459984056805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14073.
The product of its (nonzero) digits is 62208000, while the sum is 64.
The spelling of 1459984056805 in words is "one trillion, four hundred fifty-nine billion, nine hundred eighty-four million, fifty-six thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •