Base | Representation |
---|---|
bin | 100100010111100… |
… | …1010000010000011 |
3 | 10011001020202021022 |
4 | 1020233022002003 |
5 | 4444400241121 |
6 | 321031420055 |
7 | 42145363241 |
oct | 11057120203 |
9 | 3131222238 |
10 | 1220321411 |
11 | 5769265a1 |
12 | 2a082462b |
13 | 165a8ac9a |
14 | b80dd791 |
15 | 72201aab |
hex | 48bca083 |
1220321411 has 8 divisors (see below), whose sum is σ = 1232624304. Its totient is φ = 1208035360.
The previous prime is 1220321371. The next prime is 1220321429. The reversal of 1220321411 is 1141230221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1220321411 is a prime.
It is a super-2 number, since 2×12203214112 = 2978368692290061842, which contains 22 as substring.
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 1220321411.
It is not an unprimeable number, because it can be changed into a prime (1220321441) 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, 182141 + ... + 188721.
It is an arithmetic number, because the mean of its divisors is an integer number (154078038).
Almost surely, 21220321411 is an apocalyptic number.
1220321411 is a deficient number, since it is larger than the sum of its proper divisors (12302893).
1220321411 is a wasteful number, since it uses less digits than its factorization.
1220321411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8421.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 1220321411 is about 34933.0990752324. The cubic root of 1220321411 is about 1068.6235572128.
Adding to 1220321411 its reverse (1141230221), we get a palindrome (2361551632).
The spelling of 1220321411 in words is "one billion, two hundred twenty million, three hundred twenty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •