Base | Representation |
---|---|
bin | 111011100111101… |
… | …010011010111001 |
3 | 2120201011010022121 |
4 | 323213222122321 |
5 | 4022031044423 |
6 | 243130521241 |
7 | 33534003556 |
oct | 7347523271 |
9 | 2521133277 |
10 | 1000253113 |
11 | 473686a72 |
12 | 23ab96221 |
13 | 12c2c8462 |
14 | 96bb5a2d |
15 | 5cc3145d |
hex | 3b9ea6b9 |
1000253113 has 2 divisors, whose sum is σ = 1000253114. Its totient is φ = 1000253112.
The previous prime is 1000253087. The next prime is 1000253129. The reversal of 1000253113 is 3113520001.
It is an a-pointer prime, because the next prime (1000253129) can be obtained adding 1000253113 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 976750009 + 23503104 = 31253^2 + 4848^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000253113 is a prime.
It is not a weakly prime, because it can be changed into another prime (1000253213) 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, 500126556 + 500126557.
It is an arithmetic number, because the mean of its divisors is an integer number (500126557).
Almost surely, 21000253113 is an apocalyptic number.
It is an amenable number.
1000253113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000253113 is an equidigital number, since it uses as much as digits as its factorization.
1000253113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 1000253113 is about 31626.7784163990. The cubic root of 1000253113 is about 1000.0843638825.
Adding to 1000253113 its reverse (3113520001), we get a palindrome (4113773114).
The spelling of 1000253113 in words is "one billion, two hundred fifty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •