Base | Representation |
---|---|
bin | 111111100011001… |
… | …1110010101110001 |
3 | 12111121111022202222 |
4 | 1333012132111301 |
5 | 13331343403234 |
6 | 551332450425 |
7 | 103562063012 |
oct | 17706362561 |
9 | 5447438688 |
10 | 2132403569 |
11 | 9a47603aa |
12 | 4b6179a15 |
13 | 27ca24b7a |
14 | 1632c3009 |
15 | c731842e |
hex | 7f19e571 |
2132403569 has 2 divisors, whose sum is σ = 2132403570. Its totient is φ = 2132403568.
The previous prime is 2132403557. The next prime is 2132403571. The reversal of 2132403569 is 9653042312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1571329600 + 561073969 = 39640^2 + 23687^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2132403569 is a prime.
It is a super-2 number, since 2×21324035692 = 9094289962167875522, which contains 22 as substring.
Together with 2132403571, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2132403529) 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, 1066201784 + 1066201785.
It is an arithmetic number, because the mean of its divisors is an integer number (1066201785).
Almost surely, 22132403569 is an apocalyptic number.
It is an amenable number.
2132403569 is a deficient number, since it is larger than the sum of its proper divisors (1).
2132403569 is an equidigital number, since it uses as much as digits as its factorization.
2132403569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 35.
The square root of 2132403569 is about 46177.9554441294. The cubic root of 2132403569 is about 1287.1321361333.
The spelling of 2132403569 in words is "two billion, one hundred thirty-two million, four hundred three thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •