Base | Representation |
---|---|
bin | 11010001000111010… |
… | …00001110011111001 |
3 | 1100020000020122212102 |
4 | 31010131001303321 |
5 | 212220020042134 |
6 | 10240303353145 |
7 | 1004521416221 |
oct | 150435016371 |
9 | 40200218772 |
10 | 14033362169 |
11 | 5a51515782 |
12 | 28778b27b5 |
13 | 14284c02c8 |
14 | 971abd081 |
15 | 57202337e |
hex | 344741cf9 |
14033362169 has 2 divisors, whose sum is σ = 14033362170. Its totient is φ = 14033362168.
The previous prime is 14033362157. The next prime is 14033362201. The reversal of 14033362169 is 96126333041.
14033362169 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., 9680001769 + 4353360400 = 98387^2 + 65980^2 .
It is a cyclic number.
It is not a de Polignac number, because 14033362169 - 216 = 14033296633 is a prime.
It is a super-2 number, since 2×140333621692 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (14033362129) 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, 7016681084 + 7016681085.
It is an arithmetic number, because the mean of its divisors is an integer number (7016681085).
Almost surely, 214033362169 is an apocalyptic number.
It is an amenable number.
14033362169 is a deficient number, since it is larger than the sum of its proper divisors (1).
14033362169 is an equidigital number, since it uses as much as digits as its factorization.
14033362169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69984, while the sum is 38.
The spelling of 14033362169 in words is "fourteen billion, thirty-three million, three hundred sixty-two thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •