Base | Representation |
---|---|
bin | 111101001010011… |
… | …1010011010000111 |
3 | 12022000202202201122 |
4 | 1322110322122013 |
5 | 13200342134341 |
6 | 535351544155 |
7 | 101600166062 |
oct | 17224723207 |
9 | 5260682648 |
10 | 2052302471 |
11 | 96352024a |
12 | 49338b05b |
13 | 26925a77b |
14 | 1567d18d9 |
15 | c029494b |
hex | 7a53a687 |
2052302471 has 2 divisors, whose sum is σ = 2052302472. Its totient is φ = 2052302470.
The previous prime is 2052302453. The next prime is 2052302503. The reversal of 2052302471 is 1742032502.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2052302471 is a prime.
It is a super-3 number, since 3×20523024713 (a number of 29 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2052302471.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2052302401) 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 as a sum of consecutive naturals, namely, 1026151235 + 1026151236.
It is an arithmetic number, because the mean of its divisors is an integer number (1026151236).
Almost surely, 22052302471 is an apocalyptic number.
2052302471 is a deficient number, since it is larger than the sum of its proper divisors (1).
2052302471 is an equidigital number, since it uses as much as digits as its factorization.
2052302471 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 26.
The square root of 2052302471 is about 45302.3450938249. The cubic root of 2052302471 is about 1270.8095095284.
Adding to 2052302471 its reverse (1742032502), we get a palindrome (3794334973).
The spelling of 2052302471 in words is "two billion, fifty-two million, three hundred two thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •