Base | Representation |
---|---|
bin | 10101001000110011010… |
… | …110011000101000100001 |
3 | 12010212022102202102010001 |
4 | 111020303112120220201 |
5 | 142244320433432004 |
6 | 3031144055340001 |
7 | 206641542060553 |
oct | 25106326305041 |
9 | 5125272672101 |
10 | 1452560452129 |
11 | 510033563986 |
12 | 1b5623681601 |
13 | a6c8bc80a17 |
14 | 504390054d3 |
15 | 27bb76c21a4 |
hex | 15233598a21 |
1452560452129 has 2 divisors, whose sum is σ = 1452560452130. Its totient is φ = 1452560452128.
The previous prime is 1452560452127. The next prime is 1452560452181. The reversal of 1452560452129 is 9212540652541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1307512206225 + 145048245904 = 1143465^2 + 380852^2 .
It is an emirp because it is prime and its reverse (9212540652541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1452560452129 - 21 = 1452560452127 is a prime.
Together with 1452560452127, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1452560452127) 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 as a sum of consecutive naturals, namely, 726280226064 + 726280226065.
It is an arithmetic number, because the mean of its divisors is an integer number (726280226065).
Almost surely, 21452560452129 is an apocalyptic number.
It is an amenable number.
1452560452129 is a deficient number, since it is larger than the sum of its proper divisors (1).
1452560452129 is an equidigital number, since it uses as much as digits as its factorization.
1452560452129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864000, while the sum is 46.
The spelling of 1452560452129 in words is "one trillion, four hundred fifty-two billion, five hundred sixty million, four hundred fifty-two thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •