Base | Representation |
---|---|
bin | 11110000100001010111… |
… | …00111101000111001001 |
3 | 10122202102201021201121201 |
4 | 33002011130331013021 |
5 | 113411121431023423 |
6 | 2110322401504201 |
7 | 134430321364351 |
oct | 17020534750711 |
9 | 3582381251551 |
10 | 1033031111113 |
11 | 369119149631 |
12 | 148260042061 |
13 | 76550618ac1 |
14 | 37ddb275b61 |
15 | 1bd1152c2ad |
hex | f08573d1c9 |
1033031111113 has 2 divisors, whose sum is σ = 1033031111114. Its totient is φ = 1033031111112.
The previous prime is 1033031111111. The next prime is 1033031111149. The reversal of 1033031111113 is 3111111303301.
1033031111113 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., 997265871424 + 35765239689 = 998632^2 + 189117^2 .
It is a cyclic number.
It is not a de Polignac number, because 1033031111113 - 21 = 1033031111111 is a prime.
Together with 1033031111111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1033031111111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516515555556 + 516515555557.
It is an arithmetic number, because the mean of its divisors is an integer number (516515555557).
Almost surely, 21033031111113 is an apocalyptic number.
It is an amenable number.
1033031111113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1033031111113 is an equidigital number, since it uses as much as digits as its factorization.
1033031111113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 81, while the sum is 19.
Adding to 1033031111113 its reverse (3111111303301), we get a palindrome (4144142414414).
The spelling of 1033031111113 in words is "one trillion, thirty-three billion, thirty-one million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •