Base | Representation |
---|---|
bin | 1000010110010010… |
… | …1111111000001111 |
3 | 12210011211202012222 |
4 | 2011210233320033 |
5 | 14042144044043 |
6 | 1010212245555 |
7 | 106351132340 |
oct | 20544577017 |
9 | 5704752188 |
10 | 2241003023 |
11 | a4aa95816 |
12 | 5266108bb |
13 | 2993898bc |
14 | 1738b20c7 |
15 | d1b1ad68 |
hex | 8592fe0f |
2241003023 has 8 divisors (see below), whose sum is σ = 2568015648. Its totient is φ = 1915707744.
The previous prime is 2241002923. The next prime is 2241003029. The reversal of 2241003023 is 3203001422.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2241003023 - 28 = 2241002767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2241002992 and 2241003010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2241003029) 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 7 ways as a sum of consecutive naturals, for example, 426536 + ... + 431757.
It is an arithmetic number, because the mean of its divisors is an integer number (321001956).
Almost surely, 22241003023 is an apocalyptic number.
2241003023 is a deficient number, since it is larger than the sum of its proper divisors (327012625).
2241003023 is an equidigital number, since it uses as much as digits as its factorization.
2241003023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 858673.
The product of its (nonzero) digits is 288, while the sum is 17.
The square root of 2241003023 is about 47339.2334433079. The cubic root of 2241003023 is about 1308.6217898583.
Adding to 2241003023 its reverse (3203001422), we get a palindrome (5444004445).
The spelling of 2241003023 in words is "two billion, two hundred forty-one million, three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •