Base | Representation |
---|---|
bin | 101010010101101000… |
… | …0010001101001011101 |
3 | 22200200101000112222212 |
4 | 1110223100101221131 |
5 | 2442201010000333 |
6 | 105433523050205 |
7 | 6366040151366 |
oct | 1245320215135 |
9 | 280611015885 |
10 | 90920000093 |
11 | 35616a7384a |
12 | 15754b10965 |
13 | 875c5cc130 |
14 | 4587182b6d |
15 | 2572009448 |
hex | 152b411a5d |
90920000093 has 8 divisors (see below), whose sum is σ = 101290186200. Its totient is φ = 81032148288.
The previous prime is 90920000081. The next prime is 90920000141. The reversal of 90920000093 is 39000002909.
It can be written as a sum of positive squares in 4 ways, for example, as 1041159289 + 89878840804 = 32267^2 + 299798^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 90920000093 - 28 = 90919999837 is a prime.
It is a super-2 number, since 2×909200000932 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (90920000033) 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 7 ways as a sum of consecutive naturals, for example, 120583178 + ... + 120583931.
It is an arithmetic number, because the mean of its divisors is an integer number (12661273275).
Almost surely, 290920000093 is an apocalyptic number.
It is an amenable number.
90920000093 is a deficient number, since it is larger than the sum of its proper divisors (10370186107).
90920000093 is a wasteful number, since it uses less digits than its factorization.
90920000093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241167151.
The product of its (nonzero) digits is 4374, while the sum is 32.
The spelling of 90920000093 in words is "ninety billion, nine hundred twenty million, ninety-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •