Base | Representation |
---|---|
bin | 11101110011100011110… |
… | …01011101000010110111 |
3 | 10121220102012110222101002 |
4 | 32321301321131002313 |
5 | 113234340423244111 |
6 | 2102245425553515 |
7 | 133663322513654 |
oct | 16716171350267 |
9 | 3556365428332 |
10 | 1024113103031 |
11 | 36536216a117 |
12 | 1465914a589b |
13 | 7575bb45745 |
14 | 377d2ac4c2b |
15 | 1b98d64963b |
hex | ee71e5d0b7 |
1024113103031 has 2 divisors, whose sum is σ = 1024113103032. Its totient is φ = 1024113103030.
The previous prime is 1024113103003. The next prime is 1024113103073. The reversal of 1024113103031 is 1303013114201.
It is a weak prime.
It is an emirp because it is prime and its reverse (1303013114201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1024113103031 - 26 = 1024113102967 is a prime.
It is a super-2 number, since 2×10241131030312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1024113102994 and 1024113103012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1024113103001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 512056551515 + 512056551516.
It is an arithmetic number, because the mean of its divisors is an integer number (512056551516).
Almost surely, 21024113103031 is an apocalyptic number.
1024113103031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1024113103031 is an equidigital number, since it uses as much as digits as its factorization.
1024113103031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1024113103031 its reverse (1303013114201), we get a palindrome (2327126217232).
The spelling of 1024113103031 in words is "one trillion, twenty-four billion, one hundred thirteen million, one hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •