Base | Representation |
---|---|
bin | 11101101111101001001… |
… | …10100111010001101001 |
3 | 10121200222201000200212011 |
4 | 32313310212213101221 |
5 | 113221034304342301 |
6 | 2101301054515521 |
7 | 133560246161164 |
oct | 16676446472151 |
9 | 3550881020764 |
10 | 1022011012201 |
11 | 364483633173 |
12 | 1460a5505ba1 |
13 | 754b54a500a |
14 | 37673852adb |
15 | 1b8b8d1ca51 |
hex | edf49a7469 |
1022011012201 has 2 divisors, whose sum is σ = 1022011012202. Its totient is φ = 1022011012200.
The previous prime is 1022011012171. The next prime is 1022011012259. The reversal of 1022011012201 is 1022101102201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 842679936576 + 179331075625 = 917976^2 + 423475^2 .
It is a cyclic number.
It is not a de Polignac number, because 1022011012201 - 215 = 1022010979433 is a prime.
It is a super-2 number, since 2×10220110122012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1022011012901) 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, 511005506100 + 511005506101.
It is an arithmetic number, because the mean of its divisors is an integer number (511005506101).
Almost surely, 21022011012201 is an apocalyptic number.
It is an amenable number.
1022011012201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022011012201 is an equidigital number, since it uses as much as digits as its factorization.
1022011012201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1022011012201 its reverse (1022101102201), we get a palindrome (2044112114402).
The spelling of 1022011012201 in words is "one trillion, twenty-two billion, eleven million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •