Base | Representation |
---|---|
bin | 11101101101110010001… |
… | …11100101100100101101 |
3 | 10121121102011010121001221 |
4 | 32312321013211210231 |
5 | 113212013313214041 |
6 | 2101014044303341 |
7 | 133523440333555 |
oct | 16667107454455 |
9 | 3547364117057 |
10 | 1021013023021 |
11 | 364011263122 |
12 | 145a67241b51 |
13 | 753867c0184 |
14 | 375bb0aa165 |
15 | 1b85b3d72d1 |
hex | edb91e592d |
1021013023021 has 2 divisors, whose sum is σ = 1021013023022. Its totient is φ = 1021013023020.
The previous prime is 1021013023007. The next prime is 1021013023049. The reversal of 1021013023021 is 1203203101201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 929074293225 + 91938729796 = 963885^2 + 303214^2 .
It is a cyclic number.
It is not a de Polignac number, because 1021013023021 - 29 = 1021013022509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1021013022986 and 1021013023004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1021013026021) 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, 510506511510 + 510506511511.
It is an arithmetic number, because the mean of its divisors is an integer number (510506511511).
Almost surely, 21021013023021 is an apocalyptic number.
It is an amenable number.
1021013023021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021013023021 is an equidigital number, since it uses as much as digits as its factorization.
1021013023021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1021013023021 its reverse (1203203101201), we get a palindrome (2224216124222).
The spelling of 1021013023021 in words is "one trillion, twenty-one billion, thirteen million, twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •