Base | Representation |
---|---|
bin | 11101010001000110000… |
… | …111001111111100101101 |
3 | 21010021022110010201011222 |
4 | 131101012013033330231 |
5 | 230422440033444411 |
6 | 4135535301553125 |
7 | 265206634300514 |
oct | 35210607177455 |
9 | 7107273121158 |
10 | 2011220999981 |
11 | 705a54905196 |
12 | 285955a157a5 |
13 | 1178711b962b |
14 | 6d4b4c4b67b |
15 | 374b31734db |
hex | 1d4461cff2d |
2011220999981 has 2 divisors, whose sum is σ = 2011220999982. Its totient is φ = 2011220999980.
The previous prime is 2011220999947. The next prime is 2011220999993. The reversal of 2011220999981 is 1899990221102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1470604909225 + 540616090756 = 1212685^2 + 735266^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011220999981 is a prime.
It is a super-2 number, since 2×20112209999812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011220999681) 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 as a sum of consecutive naturals, namely, 1005610499990 + 1005610499991.
It is an arithmetic number, because the mean of its divisors is an integer number (1005610499991).
Almost surely, 22011220999981 is an apocalyptic number.
It is an amenable number.
2011220999981 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011220999981 is an equidigital number, since it uses as much as digits as its factorization.
2011220999981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 419904, while the sum is 53.
The spelling of 2011220999981 in words is "two trillion, eleven billion, two hundred twenty million, nine hundred ninety-nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.255 sec. • engine limits •