Base | Representation |
---|---|
bin | 10001110001001001110… |
… | …111111000111110000111 |
3 | 11022201122021220210002010 |
4 | 101301021313320332013 |
5 | 130001112041200403 |
6 | 2332531351545303 |
7 | 154133524415133 |
oct | 21611167707607 |
9 | 4281567823063 |
10 | 1221010100103 |
11 | 430911408292 |
12 | 17878198b233 |
13 | 8b1aa327ac1 |
14 | 43150a2a3c3 |
15 | 21b64480603 |
hex | 11c49df8f87 |
1221010100103 has 8 divisors (see below), whose sum is σ = 1628023378048. Its totient is φ = 814001777784.
The previous prime is 1221010100083. The next prime is 1221010100143. The reversal of 1221010100103 is 3010010101221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1221010100103 - 213 = 1221010091911 is a prime.
It is a super-2 number, since 2×12210101001032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221010100143) 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 7 ways as a sum of consecutive naturals, for example, 619801 + ... + 1681122.
It is an arithmetic number, because the mean of its divisors is an integer number (203502922256).
Almost surely, 21221010100103 is an apocalyptic number.
1221010100103 is a deficient number, since it is larger than the sum of its proper divisors (407013277945).
1221010100103 is a wasteful number, since it uses less digits than its factorization.
1221010100103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2477813.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1221010100103 its reverse (3010010101221), we get a palindrome (4231020201324).
The spelling of 1221010100103 in words is "one trillion, two hundred twenty-one billion, ten million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •