Base | Representation |
---|---|
bin | 10111011011000000101010… |
… | …000010110010001001011111 |
3 | 111111201202220201020120011211 |
4 | 113123000222002302021133 |
5 | 102000213414424000111 |
6 | 1003030405322325251 |
7 | 30461212406263162 |
oct | 2733005202621137 |
9 | 444652821216154 |
10 | 103011201000031 |
11 | 2a905894516a75 |
12 | b678316959827 |
13 | 4562bb74179cc |
14 | 1b61aa957bad9 |
15 | bd9857558521 |
hex | 5db02a0b225f |
103011201000031 has 2 divisors, whose sum is σ = 103011201000032. Its totient is φ = 103011201000030.
The previous prime is 103011201000023. The next prime is 103011201000139. The reversal of 103011201000031 is 130000102110301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103011201000031 - 23 = 103011201000023 is a prime.
It is a super-2 number, since 2×1030112010000312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103011200999975 and 103011201000020.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103011201000931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51505600500015 + 51505600500016.
It is an arithmetic number, because the mean of its divisors is an integer number (51505600500016).
Almost surely, 2103011201000031 is an apocalyptic number.
103011201000031 is a deficient number, since it is larger than the sum of its proper divisors (1).
103011201000031 is an equidigital number, since it uses as much as digits as its factorization.
103011201000031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 103011201000031 its reverse (130000102110301), we get a palindrome (233011303110332).
The spelling of 103011201000031 in words is "one hundred three trillion, eleven billion, two hundred one million, thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •