Base | Representation |
---|---|
bin | 111101011001001… |
… | …100000010111001 |
3 | 2122210011002100211 |
4 | 331121030002321 |
5 | 4102140404423 |
6 | 250112431121 |
7 | 34344652453 |
oct | 7531140271 |
9 | 2583132324 |
10 | 1030013113 |
11 | 489463108 |
12 | 248b484a1 |
13 | 13551811c |
14 | 9ab212d3 |
15 | 6065e10d |
hex | 3d64c0b9 |
1030013113 has 2 divisors, whose sum is σ = 1030013114. Its totient is φ = 1030013112.
The previous prime is 1030013107. The next prime is 1030013147. The reversal of 1030013113 is 3113100301.
It is a happy number.
1030013113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 950303929 + 79709184 = 30827^2 + 8928^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030013113 - 29 = 1030012601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1030013093 and 1030013102.
It is not a weakly prime, because it can be changed into another prime (1030013513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515006556 + 515006557.
It is an arithmetic number, because the mean of its divisors is an integer number (515006557).
Almost surely, 21030013113 is an apocalyptic number.
It is an amenable number.
1030013113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030013113 is an equidigital number, since it uses as much as digits as its factorization.
1030013113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 13.
The square root of 1030013113 is about 32093.8173640968. The cubic root of 1030013113 is about 1009.9059197406.
Adding to 1030013113 its reverse (3113100301), we get a palindrome (4143113414).
The spelling of 1030013113 in words is "one billion, thirty million, thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •