Base | Representation |
---|---|
bin | 11010101011111010… |
… | …01110101110001011 |
3 | 1100222110210211122111 |
4 | 31111331032232023 |
5 | 213320204010311 |
6 | 10325353403151 |
7 | 1015015425625 |
oct | 152575165613 |
9 | 40873724574 |
10 | 14327016331 |
11 | 6092255471 |
12 | 293a1094b7 |
13 | 14742a8874 |
14 | 99cabdc15 |
15 | 58cbcbd21 |
hex | 355f4eb8b |
14327016331 has 2 divisors, whose sum is σ = 14327016332. Its totient is φ = 14327016330.
The previous prime is 14327016313. The next prime is 14327016359. The reversal of 14327016331 is 13361072341.
Together with previous prime (14327016313) 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 14327016331 - 25 = 14327016299 is a prime.
It is a super-2 number, since 2×143270163312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14327016293 and 14327016302.
It is not a weakly prime, because it can be changed into another prime (14327016391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7163508165 + 7163508166.
It is an arithmetic number, because the mean of its divisors is an integer number (7163508166).
Almost surely, 214327016331 is an apocalyptic number.
14327016331 is a deficient number, since it is larger than the sum of its proper divisors (1).
14327016331 is an equidigital number, since it uses as much as digits as its factorization.
14327016331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 31.
Adding to 14327016331 its reverse (13361072341), we get a palindrome (27688088672).
The spelling of 14327016331 in words is "fourteen billion, three hundred twenty-seven million, sixteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •