Base | Representation |
---|---|
bin | 101011010011011… |
… | …1011010110001001 |
3 | 10202021011100012021 |
4 | 1112212323112021 |
5 | 10433434421004 |
6 | 400103444441 |
7 | 51002452114 |
oct | 12646732611 |
9 | 3667140167 |
10 | 1453045129 |
11 | 68622a348 |
12 | 346756721 |
13 | 1a2061c23 |
14 | dad9d57b |
15 | 87871d54 |
hex | 569bb589 |
1453045129 has 2 divisors, whose sum is σ = 1453045130. Its totient is φ = 1453045128.
The previous prime is 1453045109. The next prime is 1453045151. The reversal of 1453045129 is 9215403541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 849605904 + 603439225 = 29148^2 + 24565^2 .
It is a cyclic number.
It is not a de Polignac number, because 1453045129 - 27 = 1453045001 is a prime.
It is a super-2 number, since 2×14530451292 = 4222680293821253282, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1453045094 and 1453045103.
It is not a weakly prime, because it can be changed into another prime (1453045109) 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, 726522564 + 726522565.
It is an arithmetic number, because the mean of its divisors is an integer number (726522565).
Almost surely, 21453045129 is an apocalyptic number.
It is an amenable number.
1453045129 is a deficient number, since it is larger than the sum of its proper divisors (1).
1453045129 is an equidigital number, since it uses as much as digits as its factorization.
1453045129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 34.
The square root of 1453045129 is about 38118.8290612395. The cubic root of 1453045129 is about 1132.6429713575.
The spelling of 1453045129 in words is "one billion, four hundred fifty-three million, forty-five thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •