Base | Representation |
---|---|
bin | 11010110101111110… |
… | …10111100010101111 |
3 | 1101012100201011110122 |
4 | 31122333113202233 |
5 | 214003313302311 |
6 | 10342011355155 |
7 | 1020062261423 |
oct | 153277274257 |
9 | 41170634418 |
10 | 14411462831 |
11 | 6125993367 |
12 | 2962452abb |
13 | 1488934acc |
14 | 9a9dc2b83 |
15 | 59530d0db |
hex | 35afd78af |
14411462831 has 2 divisors, whose sum is σ = 14411462832. Its totient is φ = 14411462830.
The previous prime is 14411462809. The next prime is 14411462833. The reversal of 14411462831 is 13826411441.
It is a strong prime.
It is an emirp because it is prime and its reverse (13826411441) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14411462831 is a prime.
It is a super-2 number, since 2×144114628312 (a number of 21 digits) contains 22 as substring.
Together with 14411462833, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 14411462791 and 14411462800.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14411462833) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7205731415 + 7205731416.
It is an arithmetic number, because the mean of its divisors is an integer number (7205731416).
Almost surely, 214411462831 is an apocalyptic number.
14411462831 is a deficient number, since it is larger than the sum of its proper divisors (1).
14411462831 is an equidigital number, since it uses as much as digits as its factorization.
14411462831 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 18432, while the sum is 35.
The spelling of 14411462831 in words is "fourteen billion, four hundred eleven million, four hundred sixty-two thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •