Base | Representation |
---|---|
bin | 111101001010010… |
… | …0001101101110101 |
3 | 12022000120121222210 |
4 | 1322110201231311 |
5 | 13200330420313 |
6 | 535345444033 |
7 | 101566265160 |
oct | 17224415565 |
9 | 5260517883 |
10 | 2052201333 |
11 | 963461266 |
12 | 493340619 |
13 | 269223720 |
14 | 1567a6ad7 |
15 | c02749c3 |
hex | 7a521b75 |
2052201333 has 32 divisors (see below), whose sum is σ = 3476365312. Its totient is φ = 1047556800.
The previous prime is 2052201301. The next prime is 2052201367. The reversal of 2052201333 is 3331022502.
It is not a de Polignac number, because 2052201333 - 25 = 2052201301 is a prime.
It is a super-2 number, since 2×20522013332 = 8423060622333953778, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2052202333) 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 31 ways as a sum of consecutive naturals, for example, 112783 + ... + 129708.
It is an arithmetic number, because the mean of its divisors is an integer number (108636416).
Almost surely, 22052201333 is an apocalyptic number.
It is an amenable number.
2052201333 is a deficient number, since it is larger than the sum of its proper divisors (1424163979).
2052201333 is a wasteful number, since it uses less digits than its factorization.
2052201333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242545.
The product of its (nonzero) digits is 1080, while the sum is 21.
The square root of 2052201333 is about 45301.2288243928. The cubic root of 2052201333 is about 1270.7886339110.
Adding to 2052201333 its reverse (3331022502), we get a palindrome (5383223835).
The spelling of 2052201333 in words is "two billion, fifty-two million, two hundred one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •