Base | Representation |
---|---|
bin | 1000010001100001… |
… | …1101010011110111 |
3 | 12201210012200202021 |
4 | 2010120131103313 |
5 | 14022034112043 |
6 | 1004215454011 |
7 | 106016136250 |
oct | 20430352367 |
9 | 5653180667 |
10 | 2221004023 |
11 | a3a776217 |
12 | 51b987307 |
13 | 2951a6a84 |
14 | 170d87b27 |
15 | ceeba3ed |
hex | 8461d4f7 |
2221004023 has 8 divisors (see below), whose sum is σ = 2548168992. Its totient is φ = 1896308736.
The previous prime is 2221004017. The next prime is 2221004033. The reversal of 2221004023 is 3204001222.
2221004023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2221004023 - 25 = 2221003991 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2221003988 and 2221004006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2221004003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 615490 + ... + 619087.
It is an arithmetic number, because the mean of its divisors is an integer number (318521124).
Almost surely, 22221004023 is an apocalyptic number.
2221004023 is a deficient number, since it is larger than the sum of its proper divisors (327164969).
2221004023 is a wasteful number, since it uses less digits than its factorization.
2221004023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1234841.
The product of its (nonzero) digits is 192, while the sum is 16.
The square root of 2221004023 is about 47127.5293538713. The cubic root of 2221004023 is about 1304.7173823678.
Adding to 2221004023 its reverse (3204001222), we get a palindrome (5425005245).
The spelling of 2221004023 in words is "two billion, two hundred twenty-one million, four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •