Base | Representation |
---|---|
bin | 1010110011111… |
… | …01100111010011 |
3 | 20022122122002212 |
4 | 11121331213103 |
5 | 141204121201 |
6 | 12555502335 |
7 | 2150604212 |
oct | 531754723 |
9 | 208578085 |
10 | 90692051 |
11 | 4721430a |
12 | 264579ab |
13 | 15a34c48 |
14 | c08b079 |
15 | 7e66abb |
hex | 567d9d3 |
90692051 has 4 divisors (see below), whose sum is σ = 91162152. Its totient is φ = 90221952.
The previous prime is 90692009. The next prime is 90692083. The reversal of 90692051 is 15029609.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15029609 = 7 ⋅2147087.
It is a cyclic number.
It is not a de Polignac number, because 90692051 - 26 = 90691987 is a prime.
It is a super-2 number, since 2×906920512 = 16450096229173202, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 90691999 and 90692017.
It is not an unprimeable number, because it can be changed into a prime (90692551) 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 3 ways as a sum of consecutive naturals, for example, 234761 + ... + 235146.
It is an arithmetic number, because the mean of its divisors is an integer number (22790538).
Almost surely, 290692051 is an apocalyptic number.
90692051 is a deficient number, since it is larger than the sum of its proper divisors (470101).
90692051 is a wasteful number, since it uses less digits than its factorization.
90692051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470100.
The product of its (nonzero) digits is 4860, while the sum is 32.
The square root of 90692051 is about 9523.2374222215. The cubic root of 90692051 is about 449.2861950866.
The spelling of 90692051 in words is "ninety million, six hundred ninety-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.200 sec. • engine limits •