Base | Representation |
---|---|
bin | 100100010111110… |
… | …1001001111101101 |
3 | 10011001111020122111 |
4 | 1020233221033231 |
5 | 4444413334021 |
6 | 321034244021 |
7 | 42146435053 |
oct | 11057511755 |
9 | 3131436574 |
10 | 1220449261 |
11 | 576a03659 |
12 | 2a0886611 |
13 | 165b04235 |
14 | b81341d3 |
15 | 722298e1 |
hex | 48be93ed |
1220449261 has 8 divisors (see below), whose sum is σ = 1333926144. Its totient is φ = 1111604160.
The previous prime is 1220449229. The next prime is 1220449267. The reversal of 1220449261 is 1629440221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1220449261 - 25 = 1220449229 is a prime.
It is a super-2 number, since 2×12204492612 = 2978992797350892242, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220449267) 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, 1157395 + ... + 1158448.
It is an arithmetic number, because the mean of its divisors is an integer number (166740768).
Almost surely, 21220449261 is an apocalyptic number.
It is an amenable number.
1220449261 is a deficient number, since it is larger than the sum of its proper divisors (113476883).
1220449261 is a wasteful number, since it uses less digits than its factorization.
1220449261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2315891.
The product of its (nonzero) digits is 6912, while the sum is 31.
The square root of 1220449261 is about 34934.9289536990. The cubic root of 1220449261 is about 1068.6608749089.
Adding to 1220449261 its reverse (1629440221), we get a palindrome (2849889482).
The spelling of 1220449261 in words is "one billion, two hundred twenty million, four hundred forty-nine thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •