Base | Representation |
---|---|
bin | 1100011001011111101… |
… | …1010111101110100001 |
3 | 202100210111110000111111 |
4 | 3012113323113232201 |
5 | 11442212043231201 |
6 | 241504002543321 |
7 | 21250252565554 |
oct | 3062773275641 |
9 | 670714400444 |
10 | 213002320801 |
11 | 82374291276 |
12 | 35346067b41 |
13 | 1711702431a |
14 | a448c9269b |
15 | 5819bd3b51 |
hex | 3197ed7ba1 |
213002320801 has 2 divisors, whose sum is σ = 213002320802. Its totient is φ = 213002320800.
The previous prime is 213002320757. The next prime is 213002320823. The reversal of 213002320801 is 108023200312.
It is an a-pointer prime, because the next prime (213002320823) can be obtained adding 213002320801 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 196803140625 + 16199180176 = 443625^2 + 127276^2 .
It is a cyclic number.
It is not a de Polignac number, because 213002320801 - 215 = 213002288033 is a prime.
It is a super-2 number, since 2×2130023208012 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (213002323801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106501160400 + 106501160401.
It is an arithmetic number, because the mean of its divisors is an integer number (106501160401).
Almost surely, 2213002320801 is an apocalyptic number.
It is an amenable number.
213002320801 is a deficient number, since it is larger than the sum of its proper divisors (1).
213002320801 is an equidigital number, since it uses as much as digits as its factorization.
213002320801 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
The spelling of 213002320801 in words is "two hundred thirteen billion, two million, three hundred twenty thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •