Base | Representation |
---|---|
bin | 11010011100010100… |
… | …01101011000001001 |
3 | 1100122100122201201002 |
4 | 31032022031120021 |
5 | 213033211412334 |
6 | 10304401504345 |
7 | 1011536501006 |
oct | 151612153011 |
9 | 40570581632 |
10 | 14196200969 |
11 | 60254269a5 |
12 | 29023420b5 |
13 | 1453165c22 |
14 | 98958a8ad |
15 | 58148bb7e |
hex | 34e28d609 |
14196200969 has 2 divisors, whose sum is σ = 14196200970. Its totient is φ = 14196200968.
The previous prime is 14196200927. The next prime is 14196200989. The reversal of 14196200969 is 96900269141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13592761744 + 603439225 = 116588^2 + 24565^2 .
It is a cyclic number.
It is not a de Polignac number, because 14196200969 - 28 = 14196200713 is a prime.
It is a super-2 number, since 2×141962009692 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14196200989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7098100484 + 7098100485.
It is an arithmetic number, because the mean of its divisors is an integer number (7098100485).
Almost surely, 214196200969 is an apocalyptic number.
It is an amenable number.
14196200969 is a deficient number, since it is larger than the sum of its proper divisors (1).
14196200969 is an equidigital number, since it uses as much as digits as its factorization.
14196200969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 209952, while the sum is 47.
The spelling of 14196200969 in words is "fourteen billion, one hundred ninety-six million, two hundred thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •