Base | Representation |
---|---|
bin | 10111010010101111101011… |
… | …001001010001010110100111 |
3 | 111102201110211110001212200002 |
4 | 113102233223021101112213 |
5 | 101411412143233144111 |
6 | 1001513432213211515 |
7 | 30402164150012321 |
oct | 2722575311212647 |
9 | 442643743055602 |
10 | 102443210053031 |
11 | 2a706a15427791 |
12 | b5a621b930b9b |
13 | 4521479149463 |
14 | 1b423c64b6611 |
15 | bc9bb28b463b |
hex | 5d2beb2515a7 |
102443210053031 has 2 divisors, whose sum is σ = 102443210053032. Its totient is φ = 102443210053030.
The previous prime is 102443210052991. The next prime is 102443210053039. The reversal of 102443210053031 is 130350012344201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102443210053031 is a prime.
It is a super-2 number, since 2×1024432100530312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102443210052985 and 102443210053003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102443210053039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51221605026515 + 51221605026516.
It is an arithmetic number, because the mean of its divisors is an integer number (51221605026516).
Almost surely, 2102443210053031 is an apocalyptic number.
102443210053031 is a deficient number, since it is larger than the sum of its proper divisors (1).
102443210053031 is an equidigital number, since it uses as much as digits as its factorization.
102443210053031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 102443210053031 its reverse (130350012344201), we get a palindrome (232793222397232).
The spelling of 102443210053031 in words is "one hundred two trillion, four hundred forty-three billion, two hundred ten million, fifty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •