Base | Representation |
---|---|
bin | 11010011111100100… |
… | …00111100100000011 |
3 | 1100201020220121210221 |
4 | 31033302013210003 |
5 | 213112200041011 |
6 | 10311213403511 |
7 | 1012320150325 |
oct | 151762074403 |
9 | 40636817727 |
10 | 14223440131 |
11 | 60398410aa |
12 | 290b499597 |
13 | 14589b2384 |
14 | 98d03b615 |
15 | 583a6c971 |
hex | 34fc87903 |
14223440131 has 2 divisors, whose sum is σ = 14223440132. Its totient is φ = 14223440130.
The previous prime is 14223440083. The next prime is 14223440177. The reversal of 14223440131 is 13104432241.
14223440131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14223440131 - 27 = 14223440003 is a prime.
It is a super-2 number, since 2×142234401312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14223440096 and 14223440105.
It is not a weakly prime, because it can be changed into another prime (14223440731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7111720065 + 7111720066.
It is an arithmetic number, because the mean of its divisors is an integer number (7111720066).
Almost surely, 214223440131 is an apocalyptic number.
14223440131 is a deficient number, since it is larger than the sum of its proper divisors (1).
14223440131 is an equidigital number, since it uses as much as digits as its factorization.
14223440131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 14223440131 its reverse (13104432241), we get a palindrome (27327872372).
The spelling of 14223440131 in words is "fourteen billion, two hundred twenty-three million, four hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •