Base | Representation |
---|---|
bin | 1100111011001001111100… |
… | …1011001010111110100101 |
3 | 1212022111120202122101222002 |
4 | 3032302133023022332211 |
5 | 3330310421103233221 |
6 | 50120102231415045 |
7 | 2664445340515211 |
oct | 316623713127645 |
9 | 55274522571862 |
10 | 14210422321061 |
11 | 4589673a3196a |
12 | 17160a9824485 |
13 | 7c10635b88b5 |
14 | 371b06807941 |
15 | 1999a435280b |
hex | cec9f2cafa5 |
14210422321061 has 2 divisors, whose sum is σ = 14210422321062. Its totient is φ = 14210422321060.
The previous prime is 14210422321027. The next prime is 14210422321063. The reversal of 14210422321061 is 16012322401241.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14114154848161 + 96267472900 = 3756881^2 + 310270^2 .
It is a cyclic number.
It is not a de Polignac number, because 14210422321061 - 210 = 14210422320037 is a prime.
It is a super-2 number, since 2×142104223210612 (a number of 27 digits) contains 22 as substring.
Together with 14210422321063, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14210422321063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7105211160530 + 7105211160531.
It is an arithmetic number, because the mean of its divisors is an integer number (7105211160531).
Almost surely, 214210422321061 is an apocalyptic number.
It is an amenable number.
14210422321061 is a deficient number, since it is larger than the sum of its proper divisors (1).
14210422321061 is an equidigital number, since it uses as much as digits as its factorization.
14210422321061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 29.
The spelling of 14210422321061 in words is "fourteen trillion, two hundred ten billion, four hundred twenty-two million, three hundred twenty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •