Base | Representation |
---|---|
bin | 1010110000010… |
… | …01011000010101 |
3 | 20021202110000202 |
4 | 11120021120111 |
5 | 141043402312 |
6 | 12541350245 |
7 | 2143552166 |
oct | 530113025 |
9 | 207673022 |
10 | 90215957 |
11 | 46a19647 |
12 | 26268385 |
13 | 158c9330 |
14 | bda576d |
15 | 7dc09c2 |
hex | 5609615 |
90215957 has 8 divisors (see below), whose sum is σ = 102870936. Its totient is φ = 78377472.
The previous prime is 90215903. The next prime is 90215977. The reversal of 90215957 is 75951209.
It can be written as a sum of positive squares in 4 ways, for example, as 32364721 + 57851236 = 5689^2 + 7606^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 90215957 - 220 = 89167381 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 90215957.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (90215977) 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 in 7 ways as a sum of consecutive naturals, for example, 203888 + ... + 204329.
It is an arithmetic number, because the mean of its divisors is an integer number (12858867).
Almost surely, 290215957 is an apocalyptic number.
It is an amenable number.
90215957 is a deficient number, since it is larger than the sum of its proper divisors (12654979).
90215957 is a wasteful number, since it uses less digits than its factorization.
90215957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408247.
The product of its (nonzero) digits is 28350, while the sum is 38.
The square root of 90215957 is about 9498.2080941618. The cubic root of 90215957 is about 448.4986293508.
The spelling of 90215957 in words is "ninety million, two hundred fifteen thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •