Base | Representation |
---|---|
bin | 110111011100000… |
… | …000111001101001 |
3 | 2101211010111110001 |
4 | 313130000321221 |
5 | 3401100344401 |
6 | 232143023001 |
7 | 32022432256 |
oct | 6734007151 |
9 | 2354114401 |
10 | 930090601 |
11 | 438014920 |
12 | 21b59aa61 |
13 | 11a90098b |
14 | 8b75042d |
15 | 569c2601 |
hex | 37700e69 |
930090601 has 4 divisors (see below), whose sum is σ = 1014644304. Its totient is φ = 845536900.
The previous prime is 930090589. The next prime is 930090643. The reversal of 930090601 is 106090039.
It is a happy number.
930090601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 930090601 - 211 = 930088553 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 930090601.
It is not an unprimeable number, because it can be changed into a prime (930090701) 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, 42276835 + ... + 42276856.
It is an arithmetic number, because the mean of its divisors is an integer number (253661076).
Almost surely, 2930090601 is an apocalyptic number.
It is an amenable number.
930090601 is a deficient number, since it is larger than the sum of its proper divisors (84553703).
930090601 is a wasteful number, since it uses less digits than its factorization.
930090601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84553702.
The product of its (nonzero) digits is 1458, while the sum is 28.
The square root of 930090601 is about 30497.3867896907. The cubic root of 930090601 is about 976.1317040001.
The spelling of 930090601 in words is "nine hundred thirty million, ninety thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •