Base | Representation |
---|---|
bin | 100111011111100… |
… | …1111001010010101 |
3 | 10102100121010200021 |
4 | 1032333033022111 |
5 | 10203222400041 |
6 | 335255345141 |
7 | 44561004625 |
oct | 11677171225 |
9 | 3370533607 |
10 | 1325200021 |
11 | 62004a432 |
12 | 30b9821b1 |
13 | 18171c232 |
14 | c8000885 |
15 | 7b51bcd1 |
hex | 4efcf295 |
1325200021 has 2 divisors, whose sum is σ = 1325200022. Its totient is φ = 1325200020.
The previous prime is 1325199983. The next prime is 1325200033. The reversal of 1325200021 is 1200025231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1029703921 + 295496100 = 32089^2 + 17190^2 .
It is a cyclic number.
It is not a de Polignac number, because 1325200021 - 27 = 1325199893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1325199968 and 1325200004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1325200321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 662600010 + 662600011.
It is an arithmetic number, because the mean of its divisors is an integer number (662600011).
Almost surely, 21325200021 is an apocalyptic number.
It is an amenable number.
1325200021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1325200021 is an equidigital number, since it uses as much as digits as its factorization.
1325200021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 1325200021 is about 36403.2968424565. The cubic root of 1325200021 is about 1098.3998831579.
Adding to 1325200021 its reverse (1200025231), we get a palindrome (2525225252).
The spelling of 1325200021 in words is "one billion, three hundred twenty-five million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •