Base | Representation |
---|---|
bin | 10000111101100010… |
… | …00001111011111101 |
3 | 212111121202000102101 |
4 | 20132301001323331 |
5 | 122122130312221 |
6 | 4103331225101 |
7 | 441441415225 |
oct | 103661017375 |
9 | 25447660371 |
10 | 9106104061 |
11 | 395318183a |
12 | 1921748191 |
13 | b21750272 |
14 | 625555085 |
15 | 384689d91 |
hex | 21ec41efd |
9106104061 has 4 divisors (see below), whose sum is σ = 9106304800. Its totient is φ = 9105903324.
The previous prime is 9106104037. The next prime is 9106104127. The reversal of 9106104061 is 1604016019.
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 9106104061 - 29 = 9106103549 is a prime.
It is a super-2 number, since 2×91061040612 (a number of 21 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 (9106404061) 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 3 ways as a sum of consecutive naturals, for example, 3520 + ... + 134998.
It is an arithmetic number, because the mean of its divisors is an integer number (2276576200).
Almost surely, 29106104061 is an apocalyptic number.
It is an amenable number.
9106104061 is a deficient number, since it is larger than the sum of its proper divisors (200739).
9106104061 is a wasteful number, since it uses less digits than its factorization.
9106104061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200738.
The product of its (nonzero) digits is 1296, while the sum is 28.
The square root of 9106104061 is about 95425.9087512401. The cubic root of 9106104061 is about 2088.2261805997.
The spelling of 9106104061 in words is "nine billion, one hundred six million, one hundred four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •