Base | Representation |
---|---|
bin | 111111000100000… |
… | …0110000110100001 |
3 | 12110110201112202122 |
4 | 1332020012012201 |
5 | 13313202120421 |
6 | 545550154025 |
7 | 103303065644 |
oct | 17610060641 |
9 | 5413645678 |
10 | 2116051361 |
11 | 996501786 |
12 | 4b07b2915 |
13 | 27951abc8 |
14 | 161067a5b |
15 | c5b882ab |
hex | 7e2061a1 |
2116051361 has 2 divisors, whose sum is σ = 2116051362. Its totient is φ = 2116051360.
The previous prime is 2116051307. The next prime is 2116051409. The reversal of 2116051361 is 1631506112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1126005136 + 990046225 = 33556^2 + 31465^2 .
It is a cyclic number.
It is not a de Polignac number, because 2116051361 - 222 = 2111857057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2116051361.
It is not a weakly prime, because it can be changed into another prime (2116071361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1058025680 + 1058025681.
It is an arithmetic number, because the mean of its divisors is an integer number (1058025681).
Almost surely, 22116051361 is an apocalyptic number.
It is an amenable number.
2116051361 is a deficient number, since it is larger than the sum of its proper divisors (1).
2116051361 is an equidigital number, since it uses as much as digits as its factorization.
2116051361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 26.
The square root of 2116051361 is about 46000.5582683515. The cubic root of 2116051361 is about 1283.8335917936.
Adding to 2116051361 its reverse (1631506112), we get a palindrome (3747557473).
The spelling of 2116051361 in words is "two billion, one hundred sixteen million, fifty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •