Base | Representation |
---|---|
bin | 111111110101111… |
… | …0111010110110001 |
3 | 12112021221022022022 |
4 | 1333223313112301 |
5 | 13341401032421 |
6 | 552322521225 |
7 | 104041305452 |
oct | 17753672661 |
9 | 5467838268 |
10 | 2142205361 |
11 | 9aa24565a |
12 | 4b9506215 |
13 | 281a7744a |
14 | 164715129 |
15 | c81027ab |
hex | 7faf75b1 |
2142205361 has 2 divisors, whose sum is σ = 2142205362. Its totient is φ = 2142205360.
The previous prime is 2142205337. The next prime is 2142205363. The reversal of 2142205361 is 1635022412.
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., 1716030625 + 426174736 = 41425^2 + 20644^2 .
It is a cyclic number.
It is not a de Polignac number, because 2142205361 - 214 = 2142188977 is a prime.
Together with 2142205363, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2142205361.
It is not a weakly prime, because it can be changed into another prime (2142205363) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1071102680 + 1071102681.
It is an arithmetic number, because the mean of its divisors is an integer number (1071102681).
Almost surely, 22142205361 is an apocalyptic number.
It is an amenable number.
2142205361 is a deficient number, since it is larger than the sum of its proper divisors (1).
2142205361 is an equidigital number, since it uses as much as digits as its factorization.
2142205361 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 2142205361 is about 46283.9644045322. The cubic root of 2142205361 is about 1289.1012631089.
Adding to 2142205361 its reverse (1635022412), we get a palindrome (3777227773).
The spelling of 2142205361 in words is "two billion, one hundred forty-two million, two hundred five thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •