Base | Representation |
---|---|
bin | 111100001100111… |
… | …110000111011001 |
3 | 2121101112222221211 |
4 | 330030332013121 |
5 | 4032032024423 |
6 | 244120303121 |
7 | 34013065645 |
oct | 7414760731 |
9 | 2541488854 |
10 | 1010033113 |
11 | 479156911 |
12 | 242311aa1 |
13 | 131340b3b |
14 | 981ddc25 |
15 | 5da1410d |
hex | 3c33e1d9 |
1010033113 has 2 divisors, whose sum is σ = 1010033114. Its totient is φ = 1010033112.
The previous prime is 1010033081. The next prime is 1010033119. The reversal of 1010033113 is 3113300101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 974188944 + 35844169 = 31212^2 + 5987^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010033113 - 25 = 1010033081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1010033093 and 1010033102.
It is not a weakly prime, because it can be changed into another prime (1010033119) 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, 505016556 + 505016557.
It is an arithmetic number, because the mean of its divisors is an integer number (505016557).
Almost surely, 21010033113 is an apocalyptic number.
It is an amenable number.
1010033113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010033113 is an equidigital number, since it uses as much as digits as its factorization.
1010033113 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 1010033113 is about 31781.0181240312. The cubic root of 1010033113 is about 1003.3332481123. Note that the first 3 decimals are identical.
Adding to 1010033113 its reverse (3113300101), we get a palindrome (4123333214).
The spelling of 1010033113 in words is "one billion, ten million, thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •