Base | Representation |
---|---|
bin | 1001000110010111111100… |
… | …01111010110010011001011 |
3 | 2121211221212212000211222222 |
4 | 10203023332033112103023 |
5 | 10110321414103214011 |
6 | 110320323010404255 |
7 | 4133455660654304 |
oct | 443137617262313 |
9 | 77757785024888 |
10 | 20010223101131 |
11 | 641531930324a |
12 | 22b214729068b |
13 | b21c572862c3 |
14 | 4d26ddc977ab |
15 | 24a7a2612ddb |
hex | 1232fe3d64cb |
20010223101131 has 2 divisors, whose sum is σ = 20010223101132. Its totient is φ = 20010223101130.
The previous prime is 20010223100999. The next prime is 20010223101163. The reversal of 20010223101131 is 13110132201002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20010223101131 - 230 = 20009149359307 is a prime.
It is a super-2 number, since 2×200102231011312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20010223101731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005111550565 + 10005111550566.
It is an arithmetic number, because the mean of its divisors is an integer number (10005111550566).
Almost surely, 220010223101131 is an apocalyptic number.
20010223101131 is a deficient number, since it is larger than the sum of its proper divisors (1).
20010223101131 is an equidigital number, since it uses as much as digits as its factorization.
20010223101131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 20010223101131 its reverse (13110132201002), we get a palindrome (33120355302133).
The spelling of 20010223101131 in words is "twenty trillion, ten billion, two hundred twenty-three million, one hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •