Base | Representation |
---|---|
bin | 111111100010111… |
… | …0010101111111101 |
3 | 12111121011020212002 |
4 | 1333011302233331 |
5 | 13331322200041 |
6 | 551324552045 |
7 | 103560420323 |
oct | 17705625775 |
9 | 5447136762 |
10 | 2132225021 |
11 | 9a4649243 |
12 | 4b60b2625 |
13 | 27c991814 |
14 | 163277d13 |
15 | c72d059b |
hex | 7f172bfd |
2132225021 has 2 divisors, whose sum is σ = 2132225022. Its totient is φ = 2132225020.
The previous prime is 2132224999. The next prime is 2132225023. The reversal of 2132225021 is 1205222312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1081752100 + 1050472921 = 32890^2 + 32411^2 .
It is a cyclic number.
It is not a de Polignac number, because 2132225021 - 26 = 2132224957 is a prime.
Together with 2132225023, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2132224984 and 2132225002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2132225023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1066112510 + 1066112511.
It is an arithmetic number, because the mean of its divisors is an integer number (1066112511).
Almost surely, 22132225021 is an apocalyptic number.
It is an amenable number.
2132225021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2132225021 is an equidigital number, since it uses as much as digits as its factorization.
2132225021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 2132225021 is about 46176.0221435325. The cubic root of 2132225021 is about 1287.0962109006.
Adding to 2132225021 its reverse (1205222312), we get a palindrome (3337447333).
The spelling of 2132225021 in words is "two billion, one hundred thirty-two million, two hundred twenty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •