Base | Representation |
---|---|
bin | 111101010001111… |
… | …0001111111111111 |
3 | 12022022002210101122 |
4 | 1322203301333333 |
5 | 13202341401231 |
6 | 540011301155 |
7 | 101645261513 |
oct | 17243617777 |
9 | 5268083348 |
10 | 2056200191 |
11 | 965742701 |
12 | 49474a7bb |
13 | 269cc3906 |
14 | 157128143 |
15 | c07b477b |
hex | 7a8f1fff |
2056200191 has 8 divisors (see below), whose sum is σ = 2075477184. Its totient is φ = 2037012480.
The previous prime is 2056200151. The next prime is 2056200193. The reversal of 2056200191 is 1910026502.
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 2056200191 - 218 = 2055938047 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 2056200191.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2056200193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24410 + ... + 68616.
It is an arithmetic number, because the mean of its divisors is an integer number (259434648).
Almost surely, 22056200191 is an apocalyptic number.
2056200191 is a deficient number, since it is larger than the sum of its proper divisors (19276993).
2056200191 is a wasteful number, since it uses less digits than its factorization.
2056200191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44641.
The product of its (nonzero) digits is 1080, while the sum is 26.
The square root of 2056200191 is about 45345.3436529044. The cubic root of 2056200191 is about 1271.6135052490.
Adding to 2056200191 its reverse (1910026502), we get a palindrome (3966226693).
The spelling of 2056200191 in words is "two billion, fifty-six million, two hundred thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •