Base | Representation |
---|---|
bin | 11101011101011011011… |
… | …00000000101100100001 |
3 | 10120202202010210100122201 |
4 | 32232231230000230201 |
5 | 113041022203410423 |
6 | 2053002421533201 |
7 | 133063015113202 |
oct | 16565554005441 |
9 | 3522663710581 |
10 | 1012231310113 |
11 | 360315205251 |
12 | 144216274201 |
13 | 745b732aa4a |
14 | 36dc6a775a9 |
15 | 1b4e54782ad |
hex | ebadb00b21 |
1012231310113 has 2 divisors, whose sum is σ = 1012231310114. Its totient is φ = 1012231310112.
The previous prime is 1012231310087. The next prime is 1012231310143. The reversal of 1012231310113 is 3110131322101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 980797083904 + 31434226209 = 990352^2 + 177297^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012231310113 - 25 = 1012231310081 is a prime.
It is a super-2 number, since 2×10122313101132 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1012231310143) 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, 506115655056 + 506115655057.
It is an arithmetic number, because the mean of its divisors is an integer number (506115655057).
Almost surely, 21012231310113 is an apocalyptic number.
It is an amenable number.
1012231310113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012231310113 is an equidigital number, since it uses as much as digits as its factorization.
1012231310113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1012231310113 its reverse (3110131322101), we get a palindrome (4122362632214).
The spelling of 1012231310113 in words is "one trillion, twelve billion, two hundred thirty-one million, three hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •