Base | Representation |
---|---|
bin | 111101010001110… |
… | …1000101110011001 |
3 | 12022022000212021121 |
4 | 1322203220232121 |
5 | 13202334142301 |
6 | 540010405241 |
7 | 101645042662 |
oct | 17243505631 |
9 | 5268025247 |
10 | 2056162201 |
11 | 965717105 |
12 | 494730821 |
13 | 269cac532 |
14 | 157118369 |
15 | c07a83a1 |
hex | 7a8e8b99 |
2056162201 has 4 divisors (see below), whose sum is σ = 2085122304. Its totient is φ = 2027202100.
The previous prime is 2056162193. The next prime is 2056162217. The reversal of 2056162201 is 1022616502.
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 2056162201 - 23 = 2056162193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2056162231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14479945 + ... + 14480086.
It is an arithmetic number, because the mean of its divisors is an integer number (521280576).
Almost surely, 22056162201 is an apocalyptic number.
It is an amenable number.
2056162201 is a deficient number, since it is larger than the sum of its proper divisors (28960103).
2056162201 is an equidigital number, since it uses as much as digits as its factorization.
2056162201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28960102.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 2056162201 is about 45344.9247545963. The cubic root of 2056162201 is about 1271.6056738302.
Adding to 2056162201 its reverse (1022616502), we get a palindrome (3078778703).
The spelling of 2056162201 in words is "two billion, fifty-six million, one hundred sixty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •