Base | Representation |
---|---|
bin | 111100100100100… |
… | …0100110011010101 |
3 | 12020122100201222122 |
4 | 1321021010303111 |
5 | 13130300001401 |
6 | 533401505325 |
7 | 101236205603 |
oct | 17111046325 |
9 | 5218321878 |
10 | 2032422101 |
11 | 953281896 |
12 | 4887a2245 |
13 | 2650b9938 |
14 | 153cd8873 |
15 | bd66921b |
hex | 79244cd5 |
2032422101 has 2 divisors, whose sum is σ = 2032422102. Its totient is φ = 2032422100.
The previous prime is 2032422089. The next prime is 2032422103. The reversal of 2032422101 is 1012242302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1903576900 + 128845201 = 43630^2 + 11351^2 .
It is a cyclic number.
It is not a de Polignac number, because 2032422101 - 26 = 2032422037 is a prime.
Together with 2032422103, 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 2032422101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2032422103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1016211050 + 1016211051.
It is an arithmetic number, because the mean of its divisors is an integer number (1016211051).
Almost surely, 22032422101 is an apocalyptic number.
It is an amenable number.
2032422101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2032422101 is an equidigital number, since it uses as much as digits as its factorization.
2032422101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 2032422101 is about 45082.3923610981. The cubic root of 2032422101 is about 1266.6928028387.
Adding to 2032422101 its reverse (1012242302), we get a palindrome (3044664403).
The spelling of 2032422101 in words is "two billion, thirty-two million, four hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •