Base | Representation |
---|---|
bin | 100100010111101… |
… | …1110011101001111 |
3 | 10011001102000000211 |
4 | 1020233132131033 |
5 | 4444410430241 |
6 | 321033303251 |
7 | 42146162164 |
oct | 11057363517 |
9 | 3131360024 |
10 | 1220405071 |
11 | 576983436 |
12 | 2a0864b27 |
13 | 165aba0a2 |
14 | b812206b |
15 | 7221b781 |
hex | 48bde74f |
1220405071 has 4 divisors (see below), whose sum is σ = 1220474944. Its totient is φ = 1220335200.
The previous prime is 1220405051. The next prime is 1220405089. The reversal of 1220405071 is 1705040221.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1220405071 - 27 = 1220404943 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220405051) 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 3 ways as a sum of consecutive naturals, for example, 16951 + ... + 52231.
It is an arithmetic number, because the mean of its divisors is an integer number (305118736).
Almost surely, 21220405071 is an apocalyptic number.
1220405071 is a deficient number, since it is larger than the sum of its proper divisors (69873).
1220405071 is an equidigital number, since it uses as much as digits as its factorization.
1220405071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69872.
The product of its (nonzero) digits is 560, while the sum is 22.
The square root of 1220405071 is about 34934.2964864043. The cubic root of 1220405071 is about 1068.6479767367.
Adding to 1220405071 its reverse (1705040221), we get a palindrome (2925445292).
The spelling of 1220405071 in words is "one billion, two hundred twenty million, four hundred five thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •