Base | Representation |
---|---|
bin | 10101010011110011000… |
… | …001001001011111010000 |
3 | 12011222210012001200012111 |
4 | 111103303001021133100 |
5 | 142443010201421021 |
6 | 3040415342235104 |
7 | 210540233003221 |
oct | 25236301113720 |
9 | 5158705050174 |
10 | 1464366045136 |
11 | 515041502715 |
12 | 1b7979285a94 |
13 | a8120a68c07 |
14 | 50c38c99248 |
15 | 28158d408e1 |
hex | 154f30497d0 |
1464366045136 has 10 divisors (see below), whose sum is σ = 2837209212482. Its totient is φ = 732183022560.
The previous prime is 1464366045133. The next prime is 1464366045209. The reversal of 1464366045136 is 6315406634641.
It can be written as a sum of positive squares in only one way, i.e., 1393580250000 + 70785795136 = 1180500^2 + 266056^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1464366045136.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1464366045133) 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 as a sum of consecutive naturals, namely, 45761438895 + ... + 45761438926.
Almost surely, 21464366045136 is an apocalyptic number.
1464366045136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1464366045136 is a deficient number, since it is larger than the sum of its proper divisors (1372843167346).
1464366045136 is an equidigital number, since it uses as much as digits as its factorization.
1464366045136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91522877829 (or 91522877823 counting only the distinct ones).
The product of its (nonzero) digits is 3732480, while the sum is 49.
The spelling of 1464366045136 in words is "one trillion, four hundred sixty-four billion, three hundred sixty-six million, forty-five thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •