Base | Representation |
---|---|
bin | 10011100101100111… |
… | …111110001111011001 |
3 | 2000021210001002001122 |
4 | 103211213332033121 |
5 | 321033234031301 |
6 | 13355003455025 |
7 | 1343125566641 |
oct | 234547761731 |
9 | 60253032048 |
10 | 21032330201 |
11 | 8a13224a83 |
12 | 40ab827475 |
13 | 1ca25245cc |
14 | 103744b521 |
15 | 8316d681b |
hex | 4e59fe3d9 |
21032330201 has 2 divisors, whose sum is σ = 21032330202. Its totient is φ = 21032330200.
The previous prime is 21032330167. The next prime is 21032330203. The reversal of 21032330201 is 10203323012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19016410000 + 2015920201 = 137900^2 + 44899^2 .
It is a cyclic number.
It is not a de Polignac number, because 21032330201 - 234 = 3852461017 is a prime.
It is a super-3 number, since 3×210323302013 (a number of 32 digits) contains 333 as substring.
Together with 21032330203, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21032330201.
It is not a weakly prime, because it can be changed into another prime (21032330203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10516165100 + 10516165101.
It is an arithmetic number, because the mean of its divisors is an integer number (10516165101).
Almost surely, 221032330201 is an apocalyptic number.
It is an amenable number.
21032330201 is a deficient number, since it is larger than the sum of its proper divisors (1).
21032330201 is an equidigital number, since it uses as much as digits as its factorization.
21032330201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 21032330201 its reverse (10203323012), we get a palindrome (31235653213).
The spelling of 21032330201 in words is "twenty-one billion, thirty-two million, three hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •