Base | Representation |
---|---|
bin | 1000111110111000… |
… | …1001101100011111 |
3 | 20020001011200202110 |
4 | 2033232021230133 |
5 | 14414234141343 |
6 | 1035133125103 |
7 | 113516126610 |
oct | 21756115437 |
9 | 6201150673 |
10 | 2411240223 |
11 | 102809a517 |
12 | 573629793 |
13 | 2c5722b82 |
14 | 18c347c07 |
15 | e1a46833 |
hex | 8fb89b1f |
2411240223 has 16 divisors (see below), whose sum is σ = 3684133376. Its totient is φ = 1374153120.
The previous prime is 2411240219. The next prime is 2411240267. The reversal of 2411240223 is 3220421142.
It is not a de Polignac number, because 2411240223 - 22 = 2411240219 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 2411240223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2411240323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 146083 + ... + 161748.
It is an arithmetic number, because the mean of its divisors is an integer number (230258336).
Almost surely, 22411240223 is an apocalyptic number.
2411240223 is a deficient number, since it is larger than the sum of its proper divisors (1272893153).
2411240223 is a wasteful number, since it uses less digits than its factorization.
2411240223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 308214.
The product of its (nonzero) digits is 768, while the sum is 21.
The square root of 2411240223 is about 49104.3808941728. The cubic root of 2411240223 is about 1340.9528054921.
Adding to 2411240223 its reverse (3220421142), we get a palindrome (5631661365).
The spelling of 2411240223 in words is "two billion, four hundred eleven million, two hundred forty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •