Base | Representation |
---|---|
bin | 101010001100001001… |
… | …0010001000111110111 |
3 | 22122212012012000222021 |
4 | 1110120102101013313 |
5 | 2441023022131002 |
6 | 105342154014011 |
7 | 6355124132452 |
oct | 1243022210767 |
9 | 278765160867 |
10 | 90601755127 |
11 | 35473368684 |
12 | 15686417307 |
13 | 870b6b39c0 |
14 | 4556bc0499 |
15 | 25540e4737 |
hex | 15184911f7 |
90601755127 has 8 divisors (see below), whose sum is σ = 97596432864. Its totient is φ = 83610693408.
The previous prime is 90601755121. The next prime is 90601755133. The reversal of 90601755127 is 72155710609.
It is an interprime number because it is at equal distance from previous prime (90601755121) and next prime (90601755133).
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 90601755127 - 223 = 90593366519 is a prime.
It is a super-2 number, since 2×906017551272 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (90601755121) 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, 851848 + ... + 952285.
It is an arithmetic number, because the mean of its divisors is an integer number (12199554108).
Almost surely, 290601755127 is an apocalyptic number.
90601755127 is a deficient number, since it is larger than the sum of its proper divisors (6994677737).
90601755127 is a wasteful number, since it uses less digits than its factorization.
90601755127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1808009.
The product of its (nonzero) digits is 132300, while the sum is 43.
The spelling of 90601755127 in words is "ninety billion, six hundred one million, seven hundred fifty-five thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •