Base | Representation |
---|---|
bin | 11101101111110110001… |
… | …10011100110101000001 |
3 | 10121201021022010221020200 |
4 | 32313323012130311001 |
5 | 113221300211140223 |
6 | 2101315551155413 |
7 | 133563041555046 |
oct | 16677306346501 |
9 | 3551238127220 |
10 | 1022120021313 |
11 | 36452a118346 |
12 | 146115b15b69 |
13 | 75501c51351 |
14 | 3768410b1cd |
15 | 1b8c36a1a43 |
hex | edfb19cd41 |
1022120021313 has 12 divisors (see below), whose sum is σ = 1504252107540. Its totient is φ = 668556491616.
The previous prime is 1022120021249. The next prime is 1022120021323. The reversal of 1022120021313 is 3131200212201.
It can be written as a sum of positive squares in 2 ways, for example, as 785541870864 + 236578150449 = 886308^2 + 486393^2 .
It is not a de Polignac number, because 1022120021313 - 26 = 1022120021249 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1022120021323) 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 in 11 ways as a sum of consecutive naturals, for example, 1071404158 + ... + 1071405111.
It is an arithmetic number, because the mean of its divisors is an integer number (125354342295).
Almost surely, 21022120021313 is an apocalyptic number.
It is an amenable number.
1022120021313 is a deficient number, since it is larger than the sum of its proper divisors (482132086227).
1022120021313 is a wasteful number, since it uses less digits than its factorization.
1022120021313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2142809328 (or 2142809325 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1022120021313 its reverse (3131200212201), we get a palindrome (4153320233514).
The spelling of 1022120021313 in words is "one trillion, twenty-two billion, one hundred twenty million, twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •