Base | Representation |
---|---|
bin | 10111011111001110111100… |
… | …100001111000010100010011 |
3 | 111112202112000200012011112111 |
4 | 113133032330201320110103 |
5 | 102014442302341343011 |
6 | 1003412003505410151 |
7 | 30521165344255564 |
oct | 2737167441702423 |
9 | 445675020164474 |
10 | 103301421434131 |
11 | 2aa079833786a8 |
12 | b704611039957 |
13 | 458438911931b |
14 | 1b71b5b93c16b |
15 | be219139d121 |
hex | 5df3bc878513 |
103301421434131 has 2 divisors, whose sum is σ = 103301421434132. Its totient is φ = 103301421434130.
The previous prime is 103301421434069. The next prime is 103301421434171. The reversal of 103301421434131 is 131434124103301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103301421434131 - 237 = 103163982480659 is a prime.
It is a super-2 number, since 2×1033014214341312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103301421434093 and 103301421434102.
It is not a weakly prime, because it can be changed into another prime (103301421434171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51650710717065 + 51650710717066.
It is an arithmetic number, because the mean of its divisors is an integer number (51650710717066).
Almost surely, 2103301421434131 is an apocalyptic number.
103301421434131 is a deficient number, since it is larger than the sum of its proper divisors (1).
103301421434131 is an equidigital number, since it uses as much as digits as its factorization.
103301421434131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 103301421434131 its reverse (131434124103301), we get a palindrome (234735545537432).
The spelling of 103301421434131 in words is "one hundred three trillion, three hundred one billion, four hundred twenty-one million, four hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •