Base | Representation |
---|---|
bin | 11010010010001010… |
… | …01110110110101111 |
3 | 1100102102100120222021 |
4 | 31021011032312233 |
5 | 212344404311343 |
6 | 10252115531011 |
7 | 1006453415332 |
oct | 151105166657 |
9 | 40372316867 |
10 | 14111010223 |
11 | 5a9132a922 |
12 | 28998b9a67 |
13 | 143b608cbb |
14 | 97c132619 |
15 | 578c600ed |
hex | 34914edaf |
14111010223 has 2 divisors, whose sum is σ = 14111010224. Its totient is φ = 14111010222.
The previous prime is 14111010217. The next prime is 14111010239. The reversal of 14111010223 is 32201011141.
It is an a-pointer prime, because the next prime (14111010239) can be obtained adding 14111010223 to its sum of digits (16).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14111010223 - 217 = 14110879151 is a prime.
It is a super-2 number, since 2×141110102232 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14111010197 and 14111010206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14111050223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7055505111 + 7055505112.
It is an arithmetic number, because the mean of its divisors is an integer number (7055505112).
Almost surely, 214111010223 is an apocalyptic number.
14111010223 is a deficient number, since it is larger than the sum of its proper divisors (1).
14111010223 is an equidigital number, since it uses as much as digits as its factorization.
14111010223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 14111010223 its reverse (32201011141), we get a palindrome (46312021364).
The spelling of 14111010223 in words is "fourteen billion, one hundred eleven million, ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •