Base | Representation |
---|---|
bin | 10101000111101010000… |
… | …001001101101110010001 |
3 | 12010202010200202101100010 |
4 | 111013222001031232101 |
5 | 142234311010300044 |
6 | 3030422030145133 |
7 | 206566212601530 |
oct | 25075201155621 |
9 | 5122120671303 |
10 | 1451330165649 |
11 | 50a5620514a1 |
12 | 1b533b6521a9 |
13 | a6b24114060 |
14 | 5035d870317 |
15 | 27b446a2bb9 |
hex | 151ea04db91 |
1451330165649 has 64 divisors (see below), whose sum is σ = 2465349465600. Its totient is φ = 738673108992.
The previous prime is 1451330165647. The next prime is 1451330165711. The reversal of 1451330165649 is 9465610331541.
It is not a de Polignac number, because 1451330165649 - 21 = 1451330165647 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1451330165598 and 1451330165607.
It is not an unprimeable number, because it can be changed into a prime (1451330165641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12681487 + ... + 12795419.
It is an arithmetic number, because the mean of its divisors is an integer number (38521085400).
Almost surely, 21451330165649 is an apocalyptic number.
It is an amenable number.
1451330165649 is a deficient number, since it is larger than the sum of its proper divisors (1014019299951).
1451330165649 is a wasteful number, since it uses less digits than its factorization.
1451330165649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115594.
The product of its (nonzero) digits is 1166400, while the sum is 48.
The spelling of 1451330165649 in words is "one trillion, four hundred fifty-one billion, three hundred thirty million, one hundred sixty-five thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •