Base | Representation |
---|---|
bin | 1001000110101110000101… |
… | …10100001000000100010101 |
3 | 2121220002120100020020201112 |
4 | 10203113002310020010111 |
5 | 10111020240404323333 |
6 | 110330010353504405 |
7 | 4134356401353032 |
oct | 443270264100425 |
9 | 77802510206645 |
10 | 20022111011093 |
11 | 641a369765a24 |
12 | 22b4504572105 |
13 | b23100133359 |
14 | 4d310aa58389 |
15 | 24ac4b0e1948 |
hex | 1235c2d08115 |
20022111011093 has 2 divisors, whose sum is σ = 20022111011094. Its totient is φ = 20022111011092.
The previous prime is 20022111011069. The next prime is 20022111011129. The reversal of 20022111011093 is 39011011122002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19535321534884 + 486789476209 = 4419878^2 + 697703^2 .
It is a cyclic number.
It is not a de Polignac number, because 20022111011093 - 218 = 20022110748949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20022111011003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10011055505546 + 10011055505547.
It is an arithmetic number, because the mean of its divisors is an integer number (10011055505547).
Almost surely, 220022111011093 is an apocalyptic number.
It is an amenable number.
20022111011093 is a deficient number, since it is larger than the sum of its proper divisors (1).
20022111011093 is an equidigital number, since it uses as much as digits as its factorization.
20022111011093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 23.
Adding to 20022111011093 its reverse (39011011122002), we get a palindrome (59033122133095).
The spelling of 20022111011093 in words is "twenty trillion, twenty-two billion, one hundred eleven million, eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •