Base | Representation |
---|---|
bin | 111110110011110… |
… | …1000001101100001 |
3 | 12102212201010210221 |
4 | 1331213220031201 |
5 | 13304012242241 |
6 | 545043523041 |
7 | 103140540265 |
oct | 17547501541 |
9 | 5385633727 |
10 | 2107540321 |
11 | 991719267 |
12 | 4a9989481 |
13 | 27782aca3 |
14 | 15dc900a5 |
15 | c50565d1 |
hex | 7d9e8361 |
2107540321 has 2 divisors, whose sum is σ = 2107540322. Its totient is φ = 2107540320.
The previous prime is 2107540319. The next prime is 2107540333. The reversal of 2107540321 is 1230457012.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2028241296 + 79299025 = 45036^2 + 8905^2 .
It is a cyclic number.
It is not a de Polignac number, because 2107540321 - 21 = 2107540319 is a prime.
Together with 2107540319, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2107540361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1053770160 + 1053770161.
It is an arithmetic number, because the mean of its divisors is an integer number (1053770161).
Almost surely, 22107540321 is an apocalyptic number.
It is an amenable number.
2107540321 is a deficient number, since it is larger than the sum of its proper divisors (1).
2107540321 is an equidigital number, since it uses as much as digits as its factorization.
2107540321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 25.
The square root of 2107540321 is about 45907.9548771234. The cubic root of 2107540321 is about 1282.1100291077.
Adding to 2107540321 its reverse (1230457012), we get a palindrome (3337997333).
The spelling of 2107540321 in words is "two billion, one hundred seven million, five hundred forty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •