Base | Representation |
---|---|
bin | 111110101110000… |
… | …1010100010101101 |
3 | 12102200001110120122 |
4 | 1331130022202231 |
5 | 13302230111323 |
6 | 544455254325 |
7 | 103103153114 |
oct | 17534124255 |
9 | 5380043518 |
10 | 2104535213 |
11 | 98aa56500 |
12 | 4a897a3a5 |
13 | 277018211 |
14 | 15d70ac7b |
15 | c4b60ec8 |
hex | 7d70a8ad |
2104535213 has 24 divisors (see below), whose sum is σ = 2555872704. Its totient is φ = 1722343040.
The previous prime is 2104535203. The next prime is 2104535239. The reversal of 2104535213 is 3125354012.
It is a happy number.
It is not a de Polignac number, because 2104535213 - 222 = 2100340909 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2104535203) 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 in 23 ways as a sum of consecutive naturals, for example, 25070 + ... + 69552.
It is an arithmetic number, because the mean of its divisors is an integer number (106494696).
Almost surely, 22104535213 is an apocalyptic number.
2104535213 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2104535213 is a deficient number, since it is larger than the sum of its proper divisors (451337491).
2104535213 is a wasteful number, since it uses less digits than its factorization.
2104535213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44545 (or 44534 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 2104535213 is about 45875.2134926912. The cubic root of 2104535213 is about 1281.5003591887.
Adding to 2104535213 its reverse (3125354012), we get a palindrome (5229889225).
The spelling of 2104535213 in words is "two billion, one hundred four million, five hundred thirty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •