Base | Representation |
---|---|
bin | 1011110010111011… |
… | …0110011001101001 |
3 | 22011200010200120010 |
4 | 2330232312121221 |
5 | 22441044214212 |
6 | 1242110522133 |
7 | 141315640134 |
oct | 27456663151 |
9 | 8150120503 |
10 | 3166398057 |
11 | 13853927a9 |
12 | 744506349 |
13 | 3b6005224 |
14 | 22075d21b |
15 | 137eb203c |
hex | bcbb6669 |
3166398057 has 4 divisors (see below), whose sum is σ = 4221864080. Its totient is φ = 2110932036.
The previous prime is 3166398049. The next prime is 3166398083. The reversal of 3166398057 is 7508936613.
It is a happy number.
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 not a de Polignac number, because 3166398057 - 23 = 3166398049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3166397997 and 3166398015.
It is not an unprimeable number, because it can be changed into a prime (3161398057) 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, 527733007 + ... + 527733012.
It is an arithmetic number, because the mean of its divisors is an integer number (1055466020).
Almost surely, 23166398057 is an apocalyptic number.
It is an amenable number.
3166398057 is a deficient number, since it is larger than the sum of its proper divisors (1055466023).
3166398057 is a wasteful number, since it uses less digits than its factorization.
3166398057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1055466022.
The product of its (nonzero) digits is 816480, while the sum is 48.
The square root of 3166398057 is about 56270.7566769810. The cubic root of 3166398057 is about 1468.4364971997.
The spelling of 3166398057 in words is "three billion, one hundred sixty-six million, three hundred ninety-eight thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •