Base | Representation |
---|---|
bin | 11010010010100101… |
… | …00100000110101011 |
3 | 1100102122221011002022 |
4 | 31021102210012223 |
5 | 212401303131011 |
6 | 10252322455055 |
7 | 1006525212506 |
oct | 151122440653 |
9 | 40378834068 |
10 | 14114505131 |
11 | 5a932a7681 |
12 | 289ab0448b |
13 | 143c2609ac |
14 | 97c7a213d |
15 | 5792008db |
hex | 3494a41ab |
14114505131 has 2 divisors, whose sum is σ = 14114505132. Its totient is φ = 14114505130.
The previous prime is 14114505121. The next prime is 14114505133. The reversal of 14114505131 is 13150541141.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14114505131 - 226 = 14047396267 is a prime.
It is a super-2 number, since 2×141145051312 (a number of 21 digits) contains 22 as substring.
Together with 14114505133, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14114505131.
It is not a weakly prime, because it can be changed into another prime (14114505133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7057252565 + 7057252566.
It is an arithmetic number, because the mean of its divisors is an integer number (7057252566).
Almost surely, 214114505131 is an apocalyptic number.
14114505131 is a deficient number, since it is larger than the sum of its proper divisors (1).
14114505131 is an equidigital number, since it uses as much as digits as its factorization.
14114505131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 26.
The spelling of 14114505131 in words is "fourteen billion, one hundred fourteen million, five hundred five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •