Base | Representation |
---|---|
bin | 11101011010001100111… |
… | …111001110010010110101 |
3 | 21011012112222002001010122 |
4 | 131122030333032102311 |
5 | 231103002000403411 |
6 | 4144233512101325 |
7 | 266004156445505 |
oct | 35321477162265 |
9 | 7135488061118 |
10 | 2021000012981 |
11 | 70a112902414 |
12 | 287824994845 |
13 | 11876c182061 |
14 | 6db618c7a05 |
15 | 3788692d9db |
hex | 1d68cfce4b5 |
2021000012981 has 2 divisors, whose sum is σ = 2021000012982. Its totient is φ = 2021000012980.
The previous prime is 2021000012957. The next prime is 2021000013089. The reversal of 2021000012981 is 1892100001202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1284164904100 + 736835108881 = 1133210^2 + 858391^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2021000012981 is a prime.
It is a super-2 number, since 2×20210000129812 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2021000012981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2021000011981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1010500006490 + 1010500006491.
It is an arithmetic number, because the mean of its divisors is an integer number (1010500006491).
Almost surely, 22021000012981 is an apocalyptic number.
It is an amenable number.
2021000012981 is a deficient number, since it is larger than the sum of its proper divisors (1).
2021000012981 is an equidigital number, since it uses as much as digits as its factorization.
2021000012981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 26.
The spelling of 2021000012981 in words is "two trillion, twenty-one billion, twelve thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.004 sec. • engine limits •