Base | Representation |
---|---|
bin | 1001001011111011111010… |
… | …10010111100001011111001 |
3 | 2122112020011122121100220110 |
4 | 10211331331102330023321 |
5 | 10121434312311411301 |
6 | 110544210413414533 |
7 | 4153332604642431 |
oct | 445757522741371 |
9 | 78466148540813 |
10 | 20201333310201 |
11 | 648937900799a |
12 | 23231a179a449 |
13 | b36c92901754 |
14 | 4dba6d4512c1 |
15 | 25073a3ca0d6 |
hex | 125f7d4bc2f9 |
20201333310201 has 12 divisors (see below), whose sum is σ = 27002449084016. Its totient is φ = 13433970292800.
The previous prime is 20201333310199. The next prime is 20201333310203. The reversal of 20201333310201 is 10201333310202.
It is an interprime number because it is at equal distance from previous prime (20201333310199) and next prime (20201333310203).
It is not a de Polignac number, because 20201333310201 - 21 = 20201333310199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20201333310203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 20455831 + ... + 21420636.
Almost surely, 220201333310201 is an apocalyptic number.
It is an amenable number.
20201333310201 is a deficient number, since it is larger than the sum of its proper divisors (6801115773815).
20201333310201 is an frugal number, since it uses more digits than its factorization.
20201333310201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41877272 (or 41876871 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 20201333310201 its reverse (10201333310202), we get a palindrome (30402666620403).
Subtracting from 20201333310201 its reverse (10201333310202), we obtain a palindrome (9999999999999).
The spelling of 20201333310201 in words is "twenty trillion, two hundred one billion, three hundred thirty-three million, three hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •