Base | Representation |
---|---|
bin | 111000000001111… |
… | …011100010110101 |
3 | 2102111211110220212 |
4 | 320001323202311 |
5 | 3411121431013 |
6 | 233140035205 |
7 | 32203060430 |
oct | 7001734265 |
9 | 2374743825 |
10 | 940030133 |
11 | 442693609 |
12 | 222992b05 |
13 | 11c9a0b63 |
14 | 8cbba817 |
15 | 577d76a8 |
hex | 3807b8b5 |
940030133 has 4 divisors (see below), whose sum is σ = 1074320160. Its totient is φ = 805740108.
The previous prime is 940030097. The next prime is 940030151. The reversal of 940030133 is 331030049.
940030133 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 940030133 - 224 = 923252917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 940030099 and 940030108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (940030183) 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, 67145003 + ... + 67145016.
It is an arithmetic number, because the mean of its divisors is an integer number (268580040).
Almost surely, 2940030133 is an apocalyptic number.
It is an amenable number.
940030133 is a deficient number, since it is larger than the sum of its proper divisors (134290027).
940030133 is a wasteful number, since it uses less digits than its factorization.
940030133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134290026.
The product of its (nonzero) digits is 972, while the sum is 23.
The square root of 940030133 is about 30659.9108446192. The cubic root of 940030133 is about 979.5965759329.
The spelling of 940030133 in words is "nine hundred forty million, thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •