Base | Representation |
---|---|
bin | 10111100000110110001000… |
… | …110001010100000010111011 |
3 | 111120011010000120101222211111 |
4 | 113200312020301110002323 |
5 | 102023301212341324311 |
6 | 1003534530302541151 |
7 | 30532200161332312 |
oct | 2740661061240273 |
9 | 446133016358744 |
10 | 103412222214331 |
11 | 2aa4a971541828 |
12 | b721b93b977b7 |
13 | 45919664b0264 |
14 | 1b7726d211279 |
15 | be4ec8923d21 |
hex | 5e0d88c540bb |
103412222214331 has 2 divisors, whose sum is σ = 103412222214332. Its totient is φ = 103412222214330.
The previous prime is 103412222214281. The next prime is 103412222214349. The reversal of 103412222214331 is 133412222214301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103412222214331 - 227 = 103412087996603 is a prime.
It is a super-2 number, since 2×1034122222143312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103412222214293 and 103412222214302.
It is not a weakly prime, because it can be changed into another prime (103412222214731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51706111107165 + 51706111107166.
It is an arithmetic number, because the mean of its divisors is an integer number (51706111107166).
Almost surely, 2103412222214331 is an apocalyptic number.
103412222214331 is a deficient number, since it is larger than the sum of its proper divisors (1).
103412222214331 is an equidigital number, since it uses as much as digits as its factorization.
103412222214331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 103412222214331 its reverse (133412222214301), we get a palindrome (236824444428632).
The spelling of 103412222214331 in words is "one hundred three trillion, four hundred twelve billion, two hundred twenty-two million, two hundred fourteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •