Base | Representation |
---|---|
bin | 1000111111010110… |
… | …1001001011111111 |
3 | 20020011212110212012 |
4 | 2033311221023333 |
5 | 14420240013343 |
6 | 1035243201435 |
7 | 113541616553 |
oct | 21765511377 |
9 | 6204773765 |
10 | 2413204223 |
11 | 1029211061 |
12 | 57421627b |
13 | 2c5c5cac1 |
14 | 18c6d9863 |
15 | e1cd3718 |
hex | 8fd692ff |
2413204223 has 4 divisors (see below), whose sum is σ = 2413317960. Its totient is φ = 2413090488.
The previous prime is 2413204187. The next prime is 2413204249. The reversal of 2413204223 is 3224023142.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 3224023142 = 2 ⋅1612011571.
It is a cyclic number.
It is not a de Polignac number, because 2413204223 - 226 = 2346095359 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2413204273) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14540 + ... + 70977.
It is an arithmetic number, because the mean of its divisors is an integer number (603329490).
Almost surely, 22413204223 is an apocalyptic number.
2413204223 is a deficient number, since it is larger than the sum of its proper divisors (113737).
2413204223 is an equidigital number, since it uses as much as digits as its factorization.
2413204223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113736.
The product of its (nonzero) digits is 2304, while the sum is 23.
The square root of 2413204223 is about 49124.3750392817. The cubic root of 2413204223 is about 1341.3167836863.
Adding to 2413204223 its reverse (3224023142), we get a palindrome (5637227365).
The spelling of 2413204223 in words is "two billion, four hundred thirteen million, two hundred four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •