Base | Representation |
---|---|
bin | 111101001010000… |
… | …1111001010101011 |
3 | 12022000102202202210 |
4 | 1322110033022223 |
5 | 13200321002410 |
6 | 535344100203 |
7 | 101565530520 |
oct | 17224171253 |
9 | 5260382683 |
10 | 2052125355 |
11 | 96340a175 |
12 | 493304663 |
13 | 2691c7c77 |
14 | 156787147 |
15 | c025c220 |
hex | 7a50f2ab |
2052125355 has 16 divisors (see below), whose sum is σ = 3752457984. Its totient is φ = 938114400.
The previous prime is 2052125351. The next prime is 2052125359. The reversal of 2052125355 is 5535212502.
It is an interprime number because it is at equal distance from previous prime (2052125351) and next prime (2052125359).
It is not a de Polignac number, because 2052125355 - 22 = 2052125351 is a prime.
It is a super-2 number, since 2×20521253552 = 8422436945267752050, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2052125351) 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 15 ways as a sum of consecutive naturals, for example, 9771921 + ... + 9772130.
It is an arithmetic number, because the mean of its divisors is an integer number (234528624).
Almost surely, 22052125355 is an apocalyptic number.
2052125355 is a deficient number, since it is larger than the sum of its proper divisors (1700332629).
2052125355 is a wasteful number, since it uses less digits than its factorization.
2052125355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19544066.
The product of its (nonzero) digits is 15000, while the sum is 30.
The square root of 2052125355 is about 45300.3902301073. The cubic root of 2052125355 is about 1270.7729510490.
Adding to 2052125355 its reverse (5535212502), we get a palindrome (7587337857).
The spelling of 2052125355 in words is "two billion, fifty-two million, one hundred twenty-five thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •