Base | Representation |
---|---|
bin | 11010010101101000… |
… | …10110101011000011 |
3 | 1100111110011112211022 |
4 | 31022310112223003 |
5 | 212424333441402 |
6 | 10255040140055 |
7 | 1010256131423 |
oct | 151264265303 |
9 | 40443145738 |
10 | 14140140227 |
11 | 5aa6816704 |
12 | 28a760762b |
13 | 1444667ca5 |
14 | 981d56483 |
15 | 57b5b62a2 |
hex | 34ad16ac3 |
14140140227 has 2 divisors, whose sum is σ = 14140140228. Its totient is φ = 14140140226.
The previous prime is 14140140191. The next prime is 14140140241. The reversal of 14140140227 is 72204104141.
14140140227 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 14140140227 - 214 = 14140123843 is a prime.
It is a super-2 number, since 2×141401402272 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14140140196 and 14140140205.
It is not a weakly prime, because it can be changed into another prime (14140148227) 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, 7070070113 + 7070070114.
It is an arithmetic number, because the mean of its divisors is an integer number (7070070114).
Almost surely, 214140140227 is an apocalyptic number.
14140140227 is a deficient number, since it is larger than the sum of its proper divisors (1).
14140140227 is an equidigital number, since it uses as much as digits as its factorization.
14140140227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1792, while the sum is 26.
Adding to 14140140227 its reverse (72204104141), we get a palindrome (86344244368).
The spelling of 14140140227 in words is "fourteen billion, one hundred forty million, one hundred forty thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •