Base | Representation |
---|---|
bin | 11010011111011100… |
… | …01111100001000011 |
3 | 1100201012000000010022 |
4 | 31033232033201003 |
5 | 213111420033011 |
6 | 10311135524055 |
7 | 1012305416246 |
oct | 151756174103 |
9 | 40635000108 |
10 | 14222424131 |
11 | 6039207833 |
12 | 290b08962b |
13 | 1458717aa6 |
14 | 98cc5525d |
15 | 58391b8db |
hex | 34fb8f843 |
14222424131 has 2 divisors, whose sum is σ = 14222424132. Its totient is φ = 14222424130.
The previous prime is 14222424109. The next prime is 14222424157. The reversal of 14222424131 is 13142422241.
It is an a-pointer prime, because the next prime (14222424157) can be obtained adding 14222424131 to its sum of digits (26).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14222424131 - 26 = 14222424067 is a prime.
It is a super-2 number, since 2×142224241312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14222424131.
It is not a weakly prime, because it can be changed into another prime (14222424101) 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, 7111212065 + 7111212066.
It is an arithmetic number, because the mean of its divisors is an integer number (7111212066).
Almost surely, 214222424131 is an apocalyptic number.
14222424131 is a deficient number, since it is larger than the sum of its proper divisors (1).
14222424131 is an equidigital number, since it uses as much as digits as its factorization.
14222424131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3072, while the sum is 26.
Adding to 14222424131 its reverse (13142422241), we get a palindrome (27364846372).
The spelling of 14222424131 in words is "fourteen billion, two hundred twenty-two million, four hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •