Base | Representation |
---|---|
bin | 11010100101001001… |
… | …11111010001010001 |
3 | 1100211112010212112102 |
4 | 31102210333101101 |
5 | 213211201024222 |
6 | 10320010410145 |
7 | 1013426542313 |
oct | 152244772121 |
9 | 40745125472 |
10 | 14270329937 |
11 | 6063258106 |
12 | 2923130955 |
13 | 146561bc16 |
14 | 9953657b3 |
15 | 587c30d92 |
hex | 35293f451 |
14270329937 has 2 divisors, whose sum is σ = 14270329938. Its totient is φ = 14270329936.
The previous prime is 14270329919. The next prime is 14270329951. The reversal of 14270329937 is 73992307241.
14270329937 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 can be written as a sum of positive squares in only one way, i.e., 12733768336 + 1536561601 = 112844^2 + 39199^2 .
It is a cyclic number.
It is not a de Polignac number, because 14270329937 - 28 = 14270329681 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14270329891 and 14270329900.
It is not a weakly prime, because it can be changed into another prime (14270329987) 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, 7135164968 + 7135164969.
It is an arithmetic number, because the mean of its divisors is an integer number (7135164969).
Almost surely, 214270329937 is an apocalyptic number.
It is an amenable number.
14270329937 is a deficient number, since it is larger than the sum of its proper divisors (1).
14270329937 is an equidigital number, since it uses as much as digits as its factorization.
14270329937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 571536, while the sum is 47.
The spelling of 14270329937 in words is "fourteen billion, two hundred seventy million, three hundred twenty-nine thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •