Base | Representation |
---|---|
bin | 11101001000111000011… |
… | …11100011100110001101 |
3 | 10112201021102201201111222 |
4 | 32210130033203212031 |
5 | 112400430003014411 |
6 | 2043540120453125 |
7 | 132222461645054 |
oct | 16443417434615 |
9 | 3481242651458 |
10 | 1001201219981 |
11 | 356674a95286 |
12 | 14205831a1a5 |
13 | 7354a0c93b1 |
14 | 3665bbb339b |
15 | 1b09be434db |
hex | e91c3e398d |
1001201219981 has 2 divisors, whose sum is σ = 1001201219982. Its totient is φ = 1001201219980.
The previous prime is 1001201219959. The next prime is 1001201220001. The reversal of 1001201219981 is 1899121021001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 993279329956 + 7921890025 = 996634^2 + 89005^2 .
It is an emirp because it is prime and its reverse (1899121021001) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1001201219981 is a prime.
It is a super-2 number, since 2×10012012199812 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1001201219951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500600609990 + 500600609991.
It is an arithmetic number, because the mean of its divisors is an integer number (500600609991).
Almost surely, 21001201219981 is an apocalyptic number.
It is an amenable number.
1001201219981 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001201219981 is an equidigital number, since it uses as much as digits as its factorization.
1001201219981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 35.
The spelling of 1001201219981 in words is "one trillion, one billion, two hundred one million, two hundred nineteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •