Base | Representation |
---|---|
bin | 10101001110111010000… |
… | …001001111011111110001 |
3 | 12011111020012220211200000 |
4 | 111032322001033133301 |
5 | 142401231342114022 |
6 | 3034150314020213 |
7 | 210263140113030 |
oct | 25167201173761 |
9 | 5144205824600 |
10 | 1459114801137 |
11 | 5128972a2344 |
12 | 1b6952717669 |
13 | a7794b50646 |
14 | 5089b6b6717 |
15 | 27e4cd0b6ac |
hex | 153ba04f7f1 |
1459114801137 has 48 divisors (see below), whose sum is σ = 2516141776512. Its totient is φ = 827693769600.
The previous prime is 1459114801069. The next prime is 1459114801139. The reversal of 1459114801137 is 7311084119541.
1459114801137 is a `hidden beast` number, since 1 + 4 + 59 + 1 + 1 + 480 + 113 + 7 = 666.
It is not a de Polignac number, because 1459114801137 - 27 = 1459114801009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1459114801092 and 1459114801101.
It is not an unprimeable number, because it can be changed into a prime (1459114801139) 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 47 ways as a sum of consecutive naturals, for example, 2897614 + ... + 3363687.
It is an arithmetic number, because the mean of its divisors is an integer number (52419620344).
Almost surely, 21459114801137 is an apocalyptic number.
It is an amenable number.
1459114801137 is a deficient number, since it is larger than the sum of its proper divisors (1057026975375).
1459114801137 is an equidigital number, since it uses as much as digits as its factorization.
1459114801137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6261460 (or 6261448 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 45.
The spelling of 1459114801137 in words is "one trillion, four hundred fifty-nine billion, one hundred fourteen million, eight hundred one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •