Base | Representation |
---|---|
bin | 1000000001001101… |
… | …0001100000100101 |
3 | 12120000101011102022 |
4 | 2000103101200211 |
5 | 13402022123401 |
6 | 553332152525 |
7 | 104225153312 |
oct | 20023214045 |
9 | 5500334368 |
10 | 2152536101 |
11 | a05061261 |
12 | 500a68745 |
13 | 283c53701 |
14 | 165c43d09 |
15 | c8e9371b |
hex | 804d1825 |
2152536101 has 2 divisors, whose sum is σ = 2152536102. Its totient is φ = 2152536100.
The previous prime is 2152536077. The next prime is 2152536103. The reversal of 2152536101 is 1016352512.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2148415201 + 4120900 = 46351^2 + 2030^2 .
It is a cyclic number.
It is not a de Polignac number, because 2152536101 - 214 = 2152519717 is a prime.
It is a super-2 number, since 2×21525361012 = 9266823332216564402, which contains 22 as substring.
Together with 2152536103, 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 (2152536103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1076268050 + 1076268051.
It is an arithmetic number, because the mean of its divisors is an integer number (1076268051).
Almost surely, 22152536101 is an apocalyptic number.
It is an amenable number.
2152536101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2152536101 is an equidigital number, since it uses as much as digits as its factorization.
2152536101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1800, while the sum is 26.
The square root of 2152536101 is about 46395.4318979789. The cubic root of 2152536101 is about 1291.1701621070.
Adding to 2152536101 its reverse (1016352512), we get a palindrome (3168888613).
The spelling of 2152536101 in words is "two billion, one hundred fifty-two million, five hundred thirty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •