Base | Representation |
---|---|
bin | 111101001100011… |
… | …1000110100011011 |
3 | 12022002201201011202 |
4 | 1322120320310123 |
5 | 13201124011124 |
6 | 535430144415 |
7 | 101612066141 |
oct | 17230706433 |
9 | 5262651152 |
10 | 2053344539 |
11 | 964072164 |
12 | 4937b210b |
13 | 269533b8c |
14 | 1569c3591 |
15 | c03ed5ae |
hex | 7a638d1b |
2053344539 has 4 divisors (see below), whose sum is σ = 2053686120. Its totient is φ = 2053002960.
The previous prime is 2053344523. The next prime is 2053344569. The reversal of 2053344539 is 9354433502.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 9354433502 = 2 ⋅4677216751.
It is a cyclic number.
It is not a de Polignac number, because 2053344539 - 24 = 2053344523 is a prime.
It is a super-2 number, since 2×20533445392 = 8432447591682245042, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2053344569) 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, 161609 + ... + 173850.
It is an arithmetic number, because the mean of its divisors is an integer number (513421530).
Almost surely, 22053344539 is an apocalyptic number.
2053344539 is a deficient number, since it is larger than the sum of its proper divisors (341581).
2053344539 is an equidigital number, since it uses as much as digits as its factorization.
2053344539 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 341580.
The product of its (nonzero) digits is 194400, while the sum is 38.
The square root of 2053344539 is about 45313.8448931450. The cubic root of 2053344539 is about 1271.0245600015.
The spelling of 2053344539 in words is "two billion, fifty-three million, three hundred forty-four thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •