Base | Representation |
---|---|
bin | 10001011111101001111… |
… | …101111011011001101001 |
3 | 11020221010212021210221012 |
4 | 101133221331323121221 |
5 | 124144122111413001 |
6 | 2320143124353305 |
7 | 152600106412502 |
oct | 21375175733151 |
9 | 4227125253835 |
10 | 1202221201001 |
11 | 42394a5872a7 |
12 | 174bb9545835 |
13 | 894a4830322 |
14 | 4228b523ba9 |
15 | 21414be42bb |
hex | 117e9f7b669 |
1202221201001 has 4 divisors (see below), whose sum is σ = 1202234665104. Its totient is φ = 1202207736900.
The previous prime is 1202221200923. The next prime is 1202221201033. The reversal of 1202221201001 is 1001021222021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1202221201001 is a prime.
It is a super-2 number, since 2×12022212010012 (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 (1202221201301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6597215 + ... + 6776996.
It is an arithmetic number, because the mean of its divisors is an integer number (300558666276).
Almost surely, 21202221201001 is an apocalyptic number.
It is an amenable number.
1202221201001 is a deficient number, since it is larger than the sum of its proper divisors (13464103).
1202221201001 is an equidigital number, since it uses as much as digits as its factorization.
1202221201001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13464102.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1202221201001 its reverse (1001021222021), we get a palindrome (2203242423022).
The spelling of 1202221201001 in words is "one trillion, two hundred two billion, two hundred twenty-one million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •