Base | Representation |
---|---|
bin | 101011001110100… |
… | …0010110111110001 |
3 | 10202002021201112112 |
4 | 1112131002313301 |
5 | 10432304021023 |
6 | 355532135105 |
7 | 50641442234 |
oct | 12635026761 |
9 | 3662251475 |
10 | 1450454513 |
11 | 68481aa42 |
12 | 345907495 |
13 | 1a1665a11 |
14 | da8c741b |
15 | 8750e478 |
hex | 56742df1 |
1450454513 has 2 divisors, whose sum is σ = 1450454514. Its totient is φ = 1450454512.
The previous prime is 1450454507. The next prime is 1450454521. The reversal of 1450454513 is 3154540541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1361019664 + 89434849 = 36892^2 + 9457^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1450454513 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1450454513.
It is not a weakly prime, because it can be changed into another prime (1450454563) 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, 725227256 + 725227257.
It is an arithmetic number, because the mean of its divisors is an integer number (725227257).
Almost surely, 21450454513 is an apocalyptic number.
It is an amenable number.
1450454513 is a deficient number, since it is larger than the sum of its proper divisors (1).
1450454513 is an equidigital number, since it uses as much as digits as its factorization.
1450454513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24000, while the sum is 32.
The square root of 1450454513 is about 38084.8331097827. The cubic root of 1450454513 is about 1131.9694459262.
The spelling of 1450454513 in words is "one billion, four hundred fifty million, four hundred fifty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •