Base | Representation |
---|---|
bin | 101001111100110010… |
… | …1011011110001000001 |
3 | 22121112021222210122002 |
4 | 1103321211123301001 |
5 | 2433444142421021 |
6 | 105215114153345 |
7 | 6336301123502 |
oct | 1237145336101 |
9 | 277467883562 |
10 | 90086685761 |
11 | 35229649416 |
12 | 15561a22855 |
13 | 8658a83827 |
14 | 4508624ba9 |
15 | 2523ca150b |
hex | 14f995bc41 |
90086685761 has 8 divisors (see below), whose sum is σ = 91737592800. Its totient is φ = 88439912640.
The previous prime is 90086685757. The next prime is 90086685763. The reversal of 90086685761 is 16758668009.
It is a happy number.
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 90086685761 - 22 = 90086685757 is a prime.
It is a super-2 number, since 2×900866857612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 90086685697 and 90086685706.
It is not an unprimeable number, because it can be changed into a prime (90086685763) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 989480 + ... + 1076681.
It is an arithmetic number, because the mean of its divisors is an integer number (11467199100).
Almost surely, 290086685761 is an apocalyptic number.
It is an amenable number.
90086685761 is a deficient number, since it is larger than the sum of its proper divisors (1650907039).
90086685761 is a wasteful number, since it uses less digits than its factorization.
90086685761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2066959.
The product of its (nonzero) digits is 4354560, while the sum is 56.
The spelling of 90086685761 in words is "ninety billion, eighty-six million, six hundred eighty-five thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •