Base | Representation |
---|---|
bin | 110000010001011000000100… |
… | …000010001110010110010001 |
3 | 1000211200201012000021100012111 |
4 | 300101120010002032112101 |
5 | 210311312004042230301 |
6 | 2031305224551025321 |
7 | 62501122242002101 |
oct | 6021300402162621 |
9 | 1024621160240174 |
10 | 212300301133201 |
11 | 61711063372266 |
12 | 1b98927936b241 |
13 | 915caa8cb3b98 |
14 | 3a5d564731201 |
15 | 1982640d03551 |
hex | c1160408e591 |
212300301133201 has 64 divisors (see below), whose sum is σ = 225123348003840. Its totient is φ = 200041458140160.
The previous prime is 212300301133187. The next prime is 212300301133247. The reversal of 212300301133201 is 102331103003212.
It is not a de Polignac number, because 212300301133201 - 211 = 212300301131153 is a prime.
It is a super-2 number, since 2×2123003011332012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212300301233201) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 336450556156 + ... + 336450556786.
It is an arithmetic number, because the mean of its divisors is an integer number (3517552312560).
Almost surely, 2212300301133201 is an apocalyptic number.
It is an amenable number.
212300301133201 is a deficient number, since it is larger than the sum of its proper divisors (12823046870639).
212300301133201 is an frugal number, since it uses more digits than its factorization.
212300301133201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1523 (or 1417 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 212300301133201 its reverse (102331103003212), we get a palindrome (314631404136413).
The spelling of 212300301133201 in words is "two hundred twelve trillion, three hundred billion, three hundred one million, one hundred thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •