Base | Representation |
---|---|
bin | 101010001011110100… |
… | …0000111010110010001 |
3 | 22122211102101122002211 |
4 | 1110113220013112101 |
5 | 2441012210030131 |
6 | 105341121112121 |
7 | 6354631200454 |
oct | 1242750072621 |
9 | 278742348084 |
10 | 90590705041 |
11 | 35468100581 |
12 | 15682788641 |
13 | 87093151a5 |
14 | 455554549b |
15 | 25531605b1 |
hex | 1517a07591 |
90590705041 has 8 divisors (see below), whose sum is σ = 91220207400. Its totient is φ = 89961489792.
The previous prime is 90590705039. The next prime is 90590705063. The reversal of 90590705041 is 14050709509.
It can be written as a sum of positive squares in 4 ways, for example, as 6383370816 + 84207334225 = 79896^2 + 290185^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 90590705041 - 21 = 90590705039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 90590704985 and 90590705003.
It is not an unprimeable number, because it can be changed into a prime (90590705071) 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 in 7 ways as a sum of consecutive naturals, for example, 582061 + ... + 721093.
It is an arithmetic number, because the mean of its divisors is an integer number (11402525925).
Almost surely, 290590705041 is an apocalyptic number.
It is an amenable number.
90590705041 is a deficient number, since it is larger than the sum of its proper divisors (629502359).
90590705041 is a wasteful number, since it uses less digits than its factorization.
90590705041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143555.
The product of its (nonzero) digits is 56700, while the sum is 40.
The spelling of 90590705041 in words is "ninety billion, five hundred ninety million, seven hundred five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •