Base | Representation |
---|---|
bin | 11101101100010101000… |
… | …01001101010010000001 |
3 | 10121112101200000101101022 |
4 | 32312022201031102001 |
5 | 113203413142210423 |
6 | 2100404315315225 |
7 | 133465165125623 |
oct | 16661241152201 |
9 | 3545350011338 |
10 | 1020231210113 |
11 | 36374aa14555 |
12 | 14588944bb15 |
13 | 7529083749b |
14 | 37545316c13 |
15 | 1b812953dc8 |
hex | ed8a84d481 |
1020231210113 has 2 divisors, whose sum is σ = 1020231210114. Its totient is φ = 1020231210112.
The previous prime is 1020231210067. The next prime is 1020231210133. The reversal of 1020231210113 is 3110121320201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 932174802064 + 88056408049 = 965492^2 + 296743^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020231210113 - 212 = 1020231206017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1020231210091 and 1020231210100.
It is not a weakly prime, because it can be changed into another prime (1020231210133) 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, 510115605056 + 510115605057.
It is an arithmetic number, because the mean of its divisors is an integer number (510115605057).
Almost surely, 21020231210113 is an apocalyptic number.
It is an amenable number.
1020231210113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020231210113 is an equidigital number, since it uses as much as digits as its factorization.
1020231210113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1020231210113 its reverse (3110121320201), we get a palindrome (4130352530314).
The spelling of 1020231210113 in words is "one trillion, twenty billion, two hundred thirty-one million, two hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •