Base | Representation |
---|---|
bin | 11010100101000000… |
… | …01101111011100101 |
3 | 1100211102210022221101 |
4 | 31102200031323211 |
5 | 213210341014034 |
6 | 10315523520101 |
7 | 1013413113124 |
oct | 152240157345 |
9 | 40742708841 |
10 | 14269079269 |
11 | 60625834a5 |
12 | 2922829031 |
13 | 14652a1893 |
14 | 99511babb |
15 | 587a85514 |
hex | 35280dee5 |
14269079269 has 2 divisors, whose sum is σ = 14269079270. Its totient is φ = 14269079268.
The previous prime is 14269079261. The next prime is 14269079281. The reversal of 14269079269 is 96297096241.
14269079269 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10361204100 + 3907875169 = 101790^2 + 62513^2 .
It is a cyclic number.
It is not a de Polignac number, because 14269079269 - 23 = 14269079261 is a prime.
It is a super-2 number, since 2×142690792692 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14269079261) 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, 7134539634 + 7134539635.
It is an arithmetic number, because the mean of its divisors is an integer number (7134539635).
Almost surely, 214269079269 is an apocalyptic number.
It is an amenable number.
14269079269 is a deficient number, since it is larger than the sum of its proper divisors (1).
14269079269 is an equidigital number, since it uses as much as digits as its factorization.
14269079269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2939328, while the sum is 55.
The spelling of 14269079269 in words is "fourteen billion, two hundred sixty-nine million, seventy-nine thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •