Base | Representation |
---|---|
bin | 10111011100010011100100… |
… | …101101111001111111001111 |
3 | 111112001021201110011202112221 |
4 | 113130103210231321333033 |
5 | 102003143233421244211 |
6 | 1003135332014240211 |
7 | 30500513603144116 |
oct | 2734234455717717 |
9 | 445037643152487 |
10 | 103100232212431 |
11 | 2a93a6212a2653 |
12 | b6916231b6067 |
13 | 456b40560a88c |
14 | 1b66113934c7d |
15 | bdbd1881bc71 |
hex | 5dc4e4b79fcf |
103100232212431 has 2 divisors, whose sum is σ = 103100232212432. Its totient is φ = 103100232212430.
The previous prime is 103100232212303. The next prime is 103100232212473. The reversal of 103100232212431 is 134212232001301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103100232212431 - 27 = 103100232212303 is a prime.
It is a super-2 number, since 2×1031002322124312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103100232212396 and 103100232212405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103100232212491) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51550116106215 + 51550116106216.
It is an arithmetic number, because the mean of its divisors is an integer number (51550116106216).
Almost surely, 2103100232212431 is an apocalyptic number.
103100232212431 is a deficient number, since it is larger than the sum of its proper divisors (1).
103100232212431 is an equidigital number, since it uses as much as digits as its factorization.
103100232212431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 103100232212431 its reverse (134212232001301), we get a palindrome (237312464213732).
The spelling of 103100232212431 in words is "one hundred three trillion, one hundred billion, two hundred thirty-two million, two hundred twelve thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •