Base | Representation |
---|---|
bin | 1010110011100… |
… | …10101000000001 |
3 | 20022120100100211 |
4 | 11121302220001 |
5 | 141201201131 |
6 | 12554514121 |
7 | 2150326042 |
oct | 531625001 |
9 | 208510324 |
10 | 90647041 |
11 | 47193511 |
12 | 26435941 |
13 | 15a1a604 |
14 | c0788c9 |
15 | 7e585b1 |
hex | 5672a01 |
90647041 has 2 divisors, whose sum is σ = 90647042. Its totient is φ = 90647040.
The previous prime is 90647033. The next prime is 90647113. The reversal of 90647041 is 14074609.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90630400 + 16641 = 9520^2 + 129^2 .
It is an emirp because it is prime and its reverse (14074609) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 90647041 - 23 = 90647033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 90646994 and 90647012.
It is not a weakly prime, because it can be changed into another prime (90647021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 45323520 + 45323521.
It is an arithmetic number, because the mean of its divisors is an integer number (45323521).
Almost surely, 290647041 is an apocalyptic number.
It is an amenable number.
90647041 is a deficient number, since it is larger than the sum of its proper divisors (1).
90647041 is an equidigital number, since it uses as much as digits as its factorization.
90647041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 31.
The square root of 90647041 is about 9520.8739619848. The cubic root of 90647041 is about 449.2118566422.
The spelling of 90647041 in words is "ninety million, six hundred forty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •