Base | Representation |
---|---|
bin | 10111011011000000110000… |
… | …000000101011111001010111 |
3 | 111111201210011200121211221112 |
4 | 113123000300000223321113 |
5 | 102000214121041112211 |
6 | 1003030423300205235 |
7 | 30461215033240034 |
oct | 2733006000537127 |
9 | 444653150554845 |
10 | 103011301113431 |
11 | 2a905935a85717 |
12 | b67834439981b |
13 | 4562c0209acc9 |
14 | 1b61ab899c38b |
15 | bd986123188b |
hex | 5db03002be57 |
103011301113431 has 2 divisors, whose sum is σ = 103011301113432. Its totient is φ = 103011301113430.
The previous prime is 103011301113407. The next prime is 103011301113439. The reversal of 103011301113431 is 134311103110301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103011301113431 - 26 = 103011301113367 is a prime.
It is a super-2 number, since 2×1030113011134312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103011301113397 and 103011301113406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103011301113439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51505650556715 + 51505650556716.
It is an arithmetic number, because the mean of its divisors is an integer number (51505650556716).
Almost surely, 2103011301113431 is an apocalyptic number.
103011301113431 is a deficient number, since it is larger than the sum of its proper divisors (1).
103011301113431 is an equidigital number, since it uses as much as digits as its factorization.
103011301113431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 103011301113431 its reverse (134311103110301), we get a palindrome (237322404223732).
The spelling of 103011301113431 in words is "one hundred three trillion, eleven billion, three hundred one million, one hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •