Base | Representation |
---|---|
bin | 1000010001011001… |
… | …0110010100101001 |
3 | 12201202011121022010 |
4 | 2010112112110221 |
5 | 14021413413423 |
6 | 1004155550133 |
7 | 106011344256 |
oct | 20426262451 |
9 | 5652147263 |
10 | 2220451113 |
11 | a3a428871 |
12 | 51b75b349 |
13 | 2950421ca |
14 | 170c8242d |
15 | cee0b693 |
hex | 84596529 |
2220451113 has 8 divisors (see below), whose sum is σ = 2971290688. Its totient is φ = 1474956144.
The previous prime is 2220451081. The next prime is 2220451151. The reversal of 2220451113 is 3111540222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2220451113 - 25 = 2220451081 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 2220451113.
It is not an unprimeable number, because it can be changed into a prime (2220451313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1335181 + ... + 1336842.
It is an arithmetic number, because the mean of its divisors is an integer number (371411336).
Almost surely, 22220451113 is an apocalyptic number.
It is an amenable number.
2220451113 is a deficient number, since it is larger than the sum of its proper divisors (750839575).
2220451113 is a wasteful number, since it uses less digits than its factorization.
2220451113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2672303.
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 2220451113 is about 47121.6628844951. The cubic root of 2220451113 is about 1304.6091053377.
Adding to 2220451113 its reverse (3111540222), we get a palindrome (5331991335).
The spelling of 2220451113 in words is "two billion, two hundred twenty million, four hundred fifty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •