Base | Representation |
---|---|
bin | 111011101101011011001… |
… | …010011001101110001011 |
3 | 112112021010200101122100021 |
4 | 323231123022121232023 |
5 | 1014211400121034011 |
6 | 12420554505521311 |
7 | 602306460624556 |
oct | 73553312315613 |
9 | 15467120348307 |
10 | 4103223221131 |
11 | 13421925a0491 |
12 | 5632951a3237 |
13 | 239c173172c8 |
14 | 1028504b169d |
15 | 71b0317d471 |
hex | 3bb5b299b8b |
4103223221131 has 2 divisors, whose sum is σ = 4103223221132. Its totient is φ = 4103223221130.
The previous prime is 4103223221113. The next prime is 4103223221179. The reversal of 4103223221131 is 1311223223014.
Together with previous prime (4103223221113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4103223221131 - 27 = 4103223221003 is a prime.
It is a super-2 number, since 2×41032232211312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4103223221096 and 4103223221105.
It is not a weakly prime, because it can be changed into another prime (4103223221831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2051611610565 + 2051611610566.
It is an arithmetic number, because the mean of its divisors is an integer number (2051611610566).
Almost surely, 24103223221131 is an apocalyptic number.
4103223221131 is a deficient number, since it is larger than the sum of its proper divisors (1).
4103223221131 is an equidigital number, since it uses as much as digits as its factorization.
4103223221131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 4103223221131 its reverse (1311223223014), we get a palindrome (5414446444145).
The spelling of 4103223221131 in words is "four trillion, one hundred three billion, two hundred twenty-three million, two hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •