Base | Representation |
---|---|
bin | 100111011001… |
… | …100110011001 |
3 | 201102202000001 |
4 | 213121212121 |
5 | 10121002343 |
6 | 1005213001 |
7 | 153535111 |
oct | 47314631 |
9 | 21382001 |
10 | 10328473 |
11 | 5914a31 |
12 | 3561161 |
13 | 21a822c |
14 | 152c041 |
15 | d9044d |
hex | 9d9999 |
10328473 has 2 divisors, whose sum is σ = 10328474. Its totient is φ = 10328472.
The previous prime is 10328467. The next prime is 10328491. The reversal of 10328473 is 37482301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9412624 + 915849 = 3068^2 + 957^2 .
It is an emirp because it is prime and its reverse (37482301) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10328473 is a prime.
It is not a weakly prime, because it can be changed into another prime (10328413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5164236 + 5164237.
It is an arithmetic number, because the mean of its divisors is an integer number (5164237).
Almost surely, 210328473 is an apocalyptic number.
It is an amenable number.
10328473 is a deficient number, since it is larger than the sum of its proper divisors (1).
10328473 is an equidigital number, since it uses as much as digits as its factorization.
10328473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 28.
The square root of 10328473 is about 3213.7941751145. The cubic root of 10328473 is about 217.7770143683. Note that the first 3 decimals are identical.
It can be divided in two parts, 10328 and 473, that added together give a palindrome (10801).
The spelling of 10328473 in words is "ten million, three hundred twenty-eight thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •