Base | Representation |
---|---|
bin | 101001111001001… |
… | …1110110110101101 |
3 | 10121222011010012101 |
4 | 1103302132312231 |
5 | 10334332230014 |
6 | 351253535101 |
7 | 46556420443 |
oct | 12362366655 |
9 | 3558133171 |
10 | 1405742509 |
11 | 661561176 |
12 | 332944491 |
13 | 19530c502 |
14 | d49a8b93 |
15 | 8362b474 |
hex | 53c9edad |
1405742509 has 2 divisors, whose sum is σ = 1405742510. Its totient is φ = 1405742508.
The previous prime is 1405742501. The next prime is 1405742519. The reversal of 1405742509 is 9052475041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1377152100 + 28590409 = 37110^2 + 5347^2 .
It is a cyclic number.
It is not a de Polignac number, because 1405742509 - 23 = 1405742501 is a prime.
It is a super-3 number, since 3×14057425093 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1405742501) 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, 702871254 + 702871255.
It is an arithmetic number, because the mean of its divisors is an integer number (702871255).
Almost surely, 21405742509 is an apocalyptic number.
It is an amenable number.
1405742509 is a deficient number, since it is larger than the sum of its proper divisors (1).
1405742509 is an equidigital number, since it uses as much as digits as its factorization.
1405742509 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 50400, while the sum is 37.
The square root of 1405742509 is about 37493.2328427411. The cubic root of 1405742509 is about 1120.2163987156.
The spelling of 1405742509 in words is "one billion, four hundred five million, seven hundred forty-two thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •