Base | Representation |
---|---|
bin | 1000111010011011… |
… | …1000010111111101 |
3 | 20011202000111021012 |
4 | 2032212320113331 |
5 | 14344443311203 |
6 | 1033224445005 |
7 | 113201253665 |
oct | 21646702775 |
9 | 6152014235 |
10 | 2392557053 |
11 | 1018599587 |
12 | 569319765 |
13 | 2c18b0c43 |
14 | 189a831a5 |
15 | e00a5bd8 |
hex | 8e9b85fd |
2392557053 has 2 divisors, whose sum is σ = 2392557054. Its totient is φ = 2392557052.
The previous prime is 2392557049. The next prime is 2392557103. The reversal of 2392557053 is 3507552932.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1330644484 + 1061912569 = 36478^2 + 32587^2 .
It is a cyclic number.
It is not a de Polignac number, because 2392557053 - 22 = 2392557049 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2392557053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2392557353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1196278526 + 1196278527.
It is an arithmetic number, because the mean of its divisors is an integer number (1196278527).
Almost surely, 22392557053 is an apocalyptic number.
It is an amenable number.
2392557053 is a deficient number, since it is larger than the sum of its proper divisors (1).
2392557053 is an equidigital number, since it uses as much as digits as its factorization.
2392557053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 283500, while the sum is 41.
The square root of 2392557053 is about 48913.7716088220. The cubic root of 2392557053 is about 1337.4804241814.
The spelling of 2392557053 in words is "two billion, three hundred ninety-two million, five hundred fifty-seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •