Base | Representation |
---|---|
bin | 11010110110100… |
… | …110111110000101 |
3 | 1011101201221101112 |
4 | 122312212332011 |
5 | 1410313214023 |
6 | 112412134405 |
7 | 14110245113 |
oct | 3266467605 |
9 | 1141657345 |
10 | 450523013 |
11 | 211343676 |
12 | 106a67405 |
13 | 72450a85 |
14 | 43b96ab3 |
15 | 29843478 |
hex | 1ada6f85 |
450523013 has 2 divisors, whose sum is σ = 450523014. Its totient is φ = 450523012.
The previous prime is 450523009. The next prime is 450523019. The reversal of 450523013 is 310325054.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 320517409 + 130005604 = 17903^2 + 11402^2 .
It is a cyclic number.
It is not a de Polignac number, because 450523013 - 22 = 450523009 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 450523013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (450523019) 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, 225261506 + 225261507.
It is an arithmetic number, because the mean of its divisors is an integer number (225261507).
Almost surely, 2450523013 is an apocalyptic number.
It is an amenable number.
450523013 is a deficient number, since it is larger than the sum of its proper divisors (1).
450523013 is an equidigital number, since it uses as much as digits as its factorization.
450523013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 23.
The square root of 450523013 is about 21225.5273903854. The cubic root of 450523013 is about 766.6061987806.
Adding to 450523013 its reverse (310325054), we get a palindrome (760848067).
The spelling of 450523013 in words is "four hundred fifty million, five hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •