Base | Representation |
---|---|
bin | 111110101101010… |
… | …0011100001000111 |
3 | 12102122021000201101 |
4 | 1331122203201013 |
5 | 13302123110343 |
6 | 544442240531 |
7 | 103066444612 |
oct | 17532434107 |
9 | 5378230641 |
10 | 2104113223 |
11 | 98a798453 |
12 | 4a87b6147 |
13 | 276bcb114 |
14 | 15d63b179 |
15 | c4acae4d |
hex | 7d6a3847 |
2104113223 has 16 divisors (see below), whose sum is σ = 2150539776. Its totient is φ = 2058376320.
The previous prime is 2104113217. The next prime is 2104113259. The reversal of 2104113223 is 3223114012.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2104113223 - 217 = 2103982151 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2104113223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2104113293) 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 15 ways as a sum of consecutive naturals, for example, 4544290 + ... + 4544752.
It is an arithmetic number, because the mean of its divisors is an integer number (134408736).
Almost surely, 22104113223 is an apocalyptic number.
2104113223 is a deficient number, since it is larger than the sum of its proper divisors (46426553).
2104113223 is a wasteful number, since it uses less digits than its factorization.
2104113223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1014.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 2104113223 is about 45870.6139374655. The cubic root of 2104113223 is about 1281.4147002932.
Adding to 2104113223 its reverse (3223114012), we get a palindrome (5327227235).
The spelling of 2104113223 in words is "two billion, one hundred four million, one hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •