Base | Representation |
---|---|
bin | 10000000011001111111… |
… | …111101111010001101001 |
3 | 10220110001001101112212111 |
4 | 100003033333233101221 |
5 | 121032421303021301 |
6 | 2202413424042321 |
7 | 142455253451446 |
oct | 20031777572151 |
9 | 3813031345774 |
10 | 1103001220201 |
11 | 395864485171 |
12 | 159928a633a1 |
13 | 800217c900a |
14 | 3b557d0a9cd |
15 | 1da591d6551 |
hex | 100cffef469 |
1103001220201 has 12 divisors (see below), whose sum is σ = 1108665037900. Its totient is φ = 1097353578240.
The previous prime is 1103001220199. The next prime is 1103001220229. The reversal of 1103001220201 is 1020221003011.
It can be written as a sum of positive squares in 6 ways, for example, as 449650713600 + 653350506601 = 670560^2 + 808301^2 .
It is not a de Polignac number, because 1103001220201 - 21 = 1103001220199 is a prime.
It is a super-2 number, since 2×11030012202012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1103001220231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 456350145 + ... + 456352561.
Almost surely, 21103001220201 is an apocalyptic number.
It is an amenable number.
1103001220201 is a deficient number, since it is larger than the sum of its proper divisors (5663817699).
1103001220201 is an frugal number, since it uses more digits than its factorization.
1103001220201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5724 (or 3307 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1103001220201 its reverse (1020221003011), we get a palindrome (2123222223212).
The spelling of 1103001220201 in words is "one trillion, one hundred three billion, one million, two hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •