Base | Representation |
---|---|
bin | 111101011001001… |
… | …001000110011101 |
3 | 2122210010110211011 |
4 | 331121021012131 |
5 | 4102140013203 |
6 | 250112255221 |
7 | 34344602344 |
oct | 7531110635 |
9 | 2583113734 |
10 | 1030001053 |
11 | 489455044 |
12 | 248b41511 |
13 | 1355127a3 |
14 | 9ab1ab5b |
15 | 6065a76d |
hex | 3d64919d |
1030001053 has 2 divisors, whose sum is σ = 1030001054. Its totient is φ = 1030001052.
The previous prime is 1030001051. The next prime is 1030001087. The reversal of 1030001053 is 3501000301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1026753849 + 3247204 = 32043^2 + 1802^2 .
It is an emirp because it is prime and its reverse (3501000301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1030001053 - 21 = 1030001051 is a prime.
It is a super-2 number, since 2×10300010532 = 2121804338362217618, which contains 22 as substring.
Together with 1030001051, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030001051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515000526 + 515000527.
It is an arithmetic number, because the mean of its divisors is an integer number (515000527).
Almost surely, 21030001053 is an apocalyptic number.
It is an amenable number.
1030001053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030001053 is an equidigital number, since it uses as much as digits as its factorization.
1030001053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 45, while the sum is 13.
The square root of 1030001053 is about 32093.6294768915. The cubic root of 1030001053 is about 1009.9019782008.
Adding to 1030001053 its reverse (3501000301), we get a palindrome (4531001354).
The spelling of 1030001053 in words is "one billion, thirty million, one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •