Base | Representation |
---|---|
bin | 1001000110011001110011… |
… | …10011000000001001010001 |
3 | 2121212001110111012120201012 |
4 | 10203030321303000021101 |
5 | 10110330440402201223 |
6 | 110321010103020305 |
7 | 4133522513023223 |
oct | 443147163001121 |
9 | 77761414176635 |
10 | 20011222303313 |
11 | 641579133167a |
12 | 22b2385a3a695 |
13 | b220862a42b7 |
14 | 4d2796878413 |
15 | 24a8101d7c78 |
hex | 123339cc0251 |
20011222303313 has 2 divisors, whose sum is σ = 20011222303314. Its totient is φ = 20011222303312.
The previous prime is 20011222303301. The next prime is 20011222303363. The reversal of 20011222303313 is 31330322211002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19318943390224 + 692278913089 = 4395332^2 + 832033^2 .
It is a cyclic number.
It is not a de Polignac number, because 20011222303313 - 214 = 20011222286929 is a prime.
It is a super-2 number, since 2×200112223033132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20011222303363) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005611151656 + 10005611151657.
It is an arithmetic number, because the mean of its divisors is an integer number (10005611151657).
Almost surely, 220011222303313 is an apocalyptic number.
It is an amenable number.
20011222303313 is a deficient number, since it is larger than the sum of its proper divisors (1).
20011222303313 is an equidigital number, since it uses as much as digits as its factorization.
20011222303313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 20011222303313 its reverse (31330322211002), we get a palindrome (51341544514315).
The spelling of 20011222303313 in words is "twenty trillion, eleven billion, two hundred twenty-two million, three hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •