Base | Representation |
---|---|
bin | 1010110100010… |
… | …10010101001101 |
3 | 20022202021120010 |
4 | 11122022111031 |
5 | 141212303031 |
6 | 13000543433 |
7 | 2151212115 |
oct | 532122515 |
9 | 208667503 |
10 | 90744141 |
11 | 4724a464 |
12 | 26481b79 |
13 | 15a52877 |
14 | c0a2045 |
15 | 7e77246 |
hex | 568a54d |
90744141 has 4 divisors (see below), whose sum is σ = 120992192. Its totient is φ = 60496092.
The previous prime is 90744107. The next prime is 90744163. The reversal of 90744141 is 14144709.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14144709 = 3 ⋅4714903.
It is not a de Polignac number, because 90744141 - 26 = 90744077 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 90744099 and 90744108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (90744341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15124021 + ... + 15124026.
It is an arithmetic number, because the mean of its divisors is an integer number (30248048).
Almost surely, 290744141 is an apocalyptic number.
It is an amenable number.
90744141 is a deficient number, since it is larger than the sum of its proper divisors (30248051).
90744141 is a wasteful number, since it uses less digits than its factorization.
90744141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30248050.
The product of its (nonzero) digits is 4032, while the sum is 30.
The square root of 90744141 is about 9525.9719189173. The cubic root of 90744141 is about 449.3721961508.
The spelling of 90744141 in words is "ninety million, seven hundred forty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •