Base | Representation |
---|---|
bin | 10001110001010000100… |
… | …011001001001011110001 |
3 | 11022201221002200001210120 |
4 | 101301100203021023301 |
5 | 130001324224231001 |
6 | 2332550432320453 |
7 | 154136354415234 |
oct | 21612043111361 |
9 | 4281832601716 |
10 | 1221122102001 |
11 | 430969656a3a |
12 | 1787b33a3129 |
13 | 8b1c75b1409 |
14 | 4316186341b |
15 | 21b6e206236 |
hex | 11c508c92f1 |
1221122102001 has 8 divisors (see below), whose sum is σ = 1639090070400. Its totient is φ = 808617767472.
The previous prime is 1221122101973. The next prime is 1221122102003. The reversal of 1221122102001 is 1002012211221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1221122102001 - 26 = 1221122101937 is a prime.
It is a super-2 number, since 2×12211221020012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1221122102003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1365907945 + ... + 1365908838.
It is an arithmetic number, because the mean of its divisors is an integer number (204886258800).
Almost surely, 21221122102001 is an apocalyptic number.
It is an amenable number.
1221122102001 is a deficient number, since it is larger than the sum of its proper divisors (417967968399).
1221122102001 is a wasteful number, since it uses less digits than its factorization.
1221122102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2731816935.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1221122102001 its reverse (1002012211221), we get a palindrome (2223134313222).
The spelling of 1221122102001 in words is "one trillion, two hundred twenty-one billion, one hundred twenty-two million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •