Base | Representation |
---|---|
bin | 1100001110110011011… |
… | …0110001011001100101 |
3 | 202002101110211100102122 |
4 | 3003230312301121211 |
5 | 11420322321230201 |
6 | 240311114315325 |
7 | 21116162216435 |
oct | 3035466613145 |
9 | 662343740378 |
10 | 210132211301 |
11 | 81131178551 |
12 | 34884a28b45 |
13 | 16a7a51a78c |
14 | a255a1c2c5 |
15 | 56ecc4ae1b |
hex | 30ecdb1665 |
210132211301 has 2 divisors, whose sum is σ = 210132211302. Its totient is φ = 210132211300.
The previous prime is 210132211291. The next prime is 210132211337. The reversal of 210132211301 is 103112231012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 206247681025 + 3884530276 = 454145^2 + 62326^2 .
It is a cyclic number.
It is not a de Polignac number, because 210132211301 - 214 = 210132194917 is a prime.
It is a super-2 number, since 2×2101322113012 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 210132211301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210132211351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105066105650 + 105066105651.
It is an arithmetic number, because the mean of its divisors is an integer number (105066105651).
Almost surely, 2210132211301 is an apocalyptic number.
It is an amenable number.
210132211301 is a deficient number, since it is larger than the sum of its proper divisors (1).
210132211301 is an equidigital number, since it uses as much as digits as its factorization.
210132211301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 210132211301 its reverse (103112231012), we get a palindrome (313244442313).
The spelling of 210132211301 in words is "two hundred ten billion, one hundred thirty-two million, two hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •