Base | Representation |
---|---|
bin | 101110000100101010100… |
… | …100011110001011001111 |
3 | 102012200021022022200121011 |
4 | 232010222210132023033 |
5 | 403333140401213012 |
6 | 10422253312150051 |
7 | 444513015214432 |
oct | 56045244361317 |
9 | 12180238280534 |
10 | 3166105101007 |
11 | 1010812875662 |
12 | 431742238327 |
13 | 19c740873b14 |
14 | ad351577819 |
15 | 5755717a1a7 |
hex | 2e12a91e2cf |
3166105101007 has 4 divisors (see below), whose sum is σ = 3169379254096. Its totient is φ = 3162830947920.
The previous prime is 3166105100923. The next prime is 3166105101037. The reversal of 3166105101007 is 7001015016613.
3166105101007 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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3166105101007 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 3166105101007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3166105101037) 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, 1637075094 + ... + 1637077027.
It is an arithmetic number, because the mean of its divisors is an integer number (792344813524).
Almost surely, 23166105101007 is an apocalyptic number.
3166105101007 is a deficient number, since it is larger than the sum of its proper divisors (3274153089).
3166105101007 is an equidigital number, since it uses as much as digits as its factorization.
3166105101007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3274153088.
The product of its (nonzero) digits is 3780, while the sum is 31.
The spelling of 3166105101007 in words is "three trillion, one hundred sixty-six billion, one hundred five million, one hundred one thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •