Base | Representation |
---|---|
bin | 111110110100100… |
… | …100101001010111 |
3 | 2201110020011122021 |
4 | 332310210221113 |
5 | 4124304001413 |
6 | 252330114011 |
7 | 35055405604 |
oct | 7664445127 |
9 | 2643204567 |
10 | 1053968983 |
11 | 4a0a35551 |
12 | 254b7b907 |
13 | 13a484cb2 |
14 | 9dd996ab |
15 | 627e218d |
hex | 3ed24a57 |
1053968983 has 2 divisors, whose sum is σ = 1053968984. Its totient is φ = 1053968982.
The previous prime is 1053968959. The next prime is 1053968989. The reversal of 1053968983 is 3898693501.
It is a strong prime.
It is an emirp because it is prime and its reverse (3898693501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1053968983 - 29 = 1053968471 is a prime.
It is a super-2 number, since 2×10539689832 = 2221701234252108578, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1053968983.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1053968989) 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 as a sum of consecutive naturals, namely, 526984491 + 526984492.
It is an arithmetic number, because the mean of its divisors is an integer number (526984492).
Almost surely, 21053968983 is an apocalyptic number.
1053968983 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053968983 is an equidigital number, since it uses as much as digits as its factorization.
1053968983 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1399680, while the sum is 52.
The square root of 1053968983 is about 32464.8884643086. Note that the first 3 decimals coincide. The cubic root of 1053968983 is about 1017.6754005022.
The spelling of 1053968983 in words is "one billion, fifty-three million, nine hundred sixty-eight thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •