Base | Representation |
---|---|
bin | 1010110010101… |
… | …11100101001101 |
3 | 20022100201102011 |
4 | 11121113211031 |
5 | 141134130034 |
6 | 12552301221 |
7 | 2146355065 |
oct | 531274515 |
9 | 208321364 |
10 | 90536269 |
11 | 4711826a |
12 | 263a1811 |
13 | 159ac075 |
14 | c04a3a5 |
15 | 7e35864 |
hex | 565794d |
90536269 has 4 divisors (see below), whose sum is σ = 90725760. Its totient is φ = 90346780.
The previous prime is 90536239. The next prime is 90536297. The reversal of 90536269 is 96263509.
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.
It is a cyclic number.
It is not a de Polignac number, because 90536269 - 217 = 90405197 is a prime.
It is a super-2 number, since 2×905362692 = 16393632008880722, which contains 22 as substring.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (90536209) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 94027 + ... + 94984.
It is an arithmetic number, because the mean of its divisors is an integer number (22681440).
Almost surely, 290536269 is an apocalyptic number.
It is an amenable number.
90536269 is a deficient number, since it is larger than the sum of its proper divisors (189491).
90536269 is a wasteful number, since it uses less digits than its factorization.
90536269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189490.
The product of its (nonzero) digits is 87480, while the sum is 40.
The square root of 90536269 is about 9515.0548605880. The cubic root of 90536269 is about 449.0288009197.
The spelling of 90536269 in words is "ninety million, five hundred thirty-six thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •