Base | Representation |
---|---|
bin | 11101101111110110011… |
… | …10110000110100001011 |
3 | 10121201021110020122022001 |
4 | 32313323032300310023 |
5 | 113221301240402311 |
6 | 2101320110011431 |
7 | 133563066231631 |
oct | 16677316606413 |
9 | 3551243218261 |
10 | 1022122200331 |
11 | 364530376491 |
12 | 1461167a6b77 |
13 | 755025350cb |
14 | 37684517351 |
15 | 1b8c39824c1 |
hex | edfb3b0d0b |
1022122200331 has 2 divisors, whose sum is σ = 1022122200332. Its totient is φ = 1022122200330.
The previous prime is 1022122200313. The next prime is 1022122200383. The reversal of 1022122200331 is 1330022212201.
Together with previous prime (1022122200313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1022122200331 - 217 = 1022122069259 is a prime.
It is a super-2 number, since 2×10221222003312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1022122200299 and 1022122200308.
It is not a weakly prime, because it can be changed into another prime (1022123200331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511061100165 + 511061100166.
It is an arithmetic number, because the mean of its divisors is an integer number (511061100166).
Almost surely, 21022122200331 is an apocalyptic number.
1022122200331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022122200331 is an equidigital number, since it uses as much as digits as its factorization.
1022122200331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 1022122200331 its reverse (1330022212201), we get a palindrome (2352144412532).
The spelling of 1022122200331 in words is "one trillion, twenty-two billion, one hundred twenty-two million, two hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •