Base | Representation |
---|---|
bin | 11101011010001110010… |
… | …000000101100111000001 |
3 | 21011012121102222000110011 |
4 | 131122032100011213001 |
5 | 231103022412223243 |
6 | 4144235550304521 |
7 | 266004534564514 |
oct | 35321620054701 |
9 | 7135542860404 |
10 | 2021021211073 |
11 | 70a1238708a7 |
12 | 28782bab8141 |
13 | 1187736948c7 |
14 | 6db64644d7b |
15 | 3788871989d |
hex | 1d68e4059c1 |
2021021211073 has 2 divisors, whose sum is σ = 2021021211074. Its totient is φ = 2021021211072.
The previous prime is 2021021211071. The next prime is 2021021211103. The reversal of 2021021211073 is 3701121201202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1900270521009 + 120750690064 = 1378503^2 + 347492^2 .
It is a cyclic number.
It is not a de Polignac number, because 2021021211073 - 21 = 2021021211071 is a prime.
It is a super-2 number, since 2×20210212110732 (a number of 25 digits) contains 22 as substring.
Together with 2021021211071, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2021021211071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1010510605536 + 1010510605537.
It is an arithmetic number, because the mean of its divisors is an integer number (1010510605537).
Almost surely, 22021021211073 is an apocalyptic number.
It is an amenable number.
2021021211073 is a deficient number, since it is larger than the sum of its proper divisors (1).
2021021211073 is an equidigital number, since it uses as much as digits as its factorization.
2021021211073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 2021021211073 its reverse (3701121201202), we get a palindrome (5722142412275).
The spelling of 2021021211073 in words is "two trillion, twenty-one billion, twenty-one million, two hundred eleven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •