Base | Representation |
---|---|
bin | 111101001100101… |
… | …1010101011100001 |
3 | 12022002222202102120 |
4 | 1322121122223201 |
5 | 13201142430413 |
6 | 535433134453 |
7 | 101613214404 |
oct | 17231325341 |
9 | 5262882376 |
10 | 2053483233 |
11 | 96415738a |
12 | 49385a429 |
13 | 269582049 |
14 | 156a1bd3b |
15 | c0429723 |
hex | 7a65aae1 |
2053483233 has 4 divisors (see below), whose sum is σ = 2737977648. Its totient is φ = 1368988820.
The previous prime is 2053483213. The next prime is 2053483297. The reversal of 2053483233 is 3323843502.
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 2053483233 - 218 = 2053221089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2053483194 and 2053483203.
It is not an unprimeable number, because it can be changed into a prime (2053483213) 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, 342247203 + ... + 342247208.
It is an arithmetic number, because the mean of its divisors is an integer number (684494412).
Almost surely, 22053483233 is an apocalyptic number.
It is an amenable number.
2053483233 is a deficient number, since it is larger than the sum of its proper divisors (684494415).
2053483233 is an equidigital number, since it uses as much as digits as its factorization.
2053483233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 684494414.
The product of its (nonzero) digits is 51840, while the sum is 33.
The square root of 2053483233 is about 45315.3752384331. The cubic root of 2053483233 is about 1271.0531766491.
The spelling of 2053483233 in words is "two billion, fifty-three million, four hundred eighty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •