Base | Representation |
---|---|
bin | 11101101111110111100… |
… | …01100000111110111001 |
3 | 10121201022002101111010111 |
4 | 32313323301200332321 |
5 | 113221311103414041 |
6 | 2101321033144321 |
7 | 133563236534146 |
oct | 16677361407671 |
9 | 3551262344114 |
10 | 1022131310521 |
11 | 364535529072 |
12 | 14611985b0a1 |
13 | 755043a4959 |
14 | 376858093cd |
15 | 1b8c4681981 |
hex | edfbc60fb9 |
1022131310521 has 2 divisors, whose sum is σ = 1022131310522. Its totient is φ = 1022131310520.
The previous prime is 1022131310513. The next prime is 1022131310531. The reversal of 1022131310521 is 1250131312201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1022121000000 + 10310521 = 1011000^2 + 3211^2 .
It is an emirp because it is prime and its reverse (1250131312201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1022131310521 - 23 = 1022131310513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1022131310492 and 1022131310501.
It is not a weakly prime, because it can be changed into another prime (1022131310531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511065655260 + 511065655261.
It is an arithmetic number, because the mean of its divisors is an integer number (511065655261).
Almost surely, 21022131310521 is an apocalyptic number.
It is an amenable number.
1022131310521 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022131310521 is an equidigital number, since it uses as much as digits as its factorization.
1022131310521 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 1022131310521 its reverse (1250131312201), we get a palindrome (2272262622722).
The spelling of 1022131310521 in words is "one trillion, twenty-two billion, one hundred thirty-one million, three hundred ten thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •