Base | Representation |
---|---|
bin | 101001111110001010… |
… | …0101011011011110101 |
3 | 22121122111102202121121 |
4 | 1103330110223123311 |
5 | 2434042423001031 |
6 | 105223434543541 |
7 | 6340366446526 |
oct | 1237424533365 |
9 | 277574382547 |
10 | 90132625141 |
11 | 35252576349 |
12 | 15575297bb1 |
13 | 86654498b0 |
14 | 451078284d |
15 | 2527d28011 |
hex | 14fc52b6f5 |
90132625141 has 8 divisors (see below), whose sum is σ = 97256610360. Its totient is φ = 83035883712.
The previous prime is 90132625139. The next prime is 90132625171. The reversal of 90132625141 is 14152623109.
It can be written as a sum of positive squares in 4 ways, for example, as 2711284900 + 87421340241 = 52070^2 + 295671^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 90132625141 - 21 = 90132625139 is a prime.
It is a super-2 number, since 2×901326251412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 90132625097 and 90132625106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (90132625171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6804070 + ... + 6817303.
It is an arithmetic number, because the mean of its divisors is an integer number (12157076295).
Almost surely, 290132625141 is an apocalyptic number.
It is an amenable number.
90132625141 is a deficient number, since it is larger than the sum of its proper divisors (7123985219).
90132625141 is a wasteful number, since it uses less digits than its factorization.
90132625141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13621895.
The product of its (nonzero) digits is 12960, while the sum is 34.
The spelling of 90132625141 in words is "ninety billion, one hundred thirty-two million, six hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •