Base | Representation |
---|---|
bin | 111101111111101… |
… | …100001010010101 |
3 | 2200111010212101101 |
4 | 331333230022111 |
5 | 4112231344013 |
6 | 251113030101 |
7 | 34526520253 |
oct | 7577541225 |
9 | 2614125341 |
10 | 1040106133 |
11 | 494127150 |
12 | 2503b5331 |
13 | 137640121 |
14 | 9c1cb5d3 |
15 | 614a48dd |
hex | 3dfec295 |
1040106133 has 8 divisors (see below), whose sum is σ = 1135055520. Its totient is φ = 945222480.
The previous prime is 1040106131. The next prime is 1040106157. The reversal of 1040106133 is 3316010401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1040106133 - 21 = 1040106131 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 1040106133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1040106131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20223 + ... + 49891.
It is an arithmetic number, because the mean of its divisors is an integer number (141881940).
Almost surely, 21040106133 is an apocalyptic number.
It is an amenable number.
1040106133 is a deficient number, since it is larger than the sum of its proper divisors (94949387).
1040106133 is a wasteful number, since it uses less digits than its factorization.
1040106133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32867.
The product of its (nonzero) digits is 216, while the sum is 19.
The square root of 1040106133 is about 32250.6764735253. The cubic root of 1040106133 is about 1013.1938672783.
Adding to 1040106133 its reverse (3316010401), we get a palindrome (4356116534).
The spelling of 1040106133 in words is "one billion, forty million, one hundred six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •