Base | Representation |
---|---|
bin | 111111111101011… |
… | …1011111100001101 |
3 | 12112120101000222102 |
4 | 1333322323330031 |
5 | 13343404000201 |
6 | 552543324445 |
7 | 104120012312 |
oct | 17772737415 |
9 | 5476330872 |
10 | 2146156301 |
11 | a014a3aa3 |
12 | 4ba8b0725 |
13 | 28282b893 |
14 | 165062d09 |
15 | c863326b |
hex | 7febbf0d |
2146156301 has 2 divisors, whose sum is σ = 2146156302. Its totient is φ = 2146156300.
The previous prime is 2146156297. The next prime is 2146156303. The reversal of 2146156301 is 1036516412.
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., 1346963401 + 799192900 = 36701^2 + 28270^2 .
It is a cyclic number.
It is not a de Polignac number, because 2146156301 - 22 = 2146156297 is a prime.
It is a Sophie Germain prime.
Together with 2146156303, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2146156303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1073078150 + 1073078151.
It is an arithmetic number, because the mean of its divisors is an integer number (1073078151).
Almost surely, 22146156301 is an apocalyptic number.
It is an amenable number.
2146156301 is a deficient number, since it is larger than the sum of its proper divisors (1).
2146156301 is an equidigital number, since it uses as much as digits as its factorization.
2146156301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 29.
The square root of 2146156301 is about 46326.6262639532. The cubic root of 2146156301 is about 1289.8932870483.
The spelling of 2146156301 in words is "two billion, one hundred forty-six million, one hundred fifty-six thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •