Base | Representation |
---|---|
bin | 1000000101111000… |
… | …0000100110110101 |
3 | 12121101020111222221 |
4 | 2001132000212311 |
5 | 13422031041134 |
6 | 555312122341 |
7 | 104553531505 |
oct | 20136004665 |
9 | 5541214887 |
10 | 2172127669 |
11 | a15122738 |
12 | 5075363b1 |
13 | 288022c5a |
14 | 1686a3a05 |
15 | caa635b4 |
hex | 817809b5 |
2172127669 has 2 divisors, whose sum is σ = 2172127670. Its totient is φ = 2172127668.
The previous prime is 2172127667. The next prime is 2172127703. The reversal of 2172127669 is 9667212712.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1165334769 + 1006792900 = 34137^2 + 31730^2 .
It is a cyclic number.
It is not a de Polignac number, because 2172127669 - 21 = 2172127667 is a prime.
It is a super-2 number, since 2×21721276692 = 9436277220870747122, which contains 22 as substring.
Together with 2172127667, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2172127667) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1086063834 + 1086063835.
It is an arithmetic number, because the mean of its divisors is an integer number (1086063835).
Almost surely, 22172127669 is an apocalyptic number.
It is an amenable number.
2172127669 is a deficient number, since it is larger than the sum of its proper divisors (1).
2172127669 is an equidigital number, since it uses as much as digits as its factorization.
2172127669 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 127008, while the sum is 43.
The square root of 2172127669 is about 46606.0904710962. The cubic root of 2172127669 is about 1295.0755846026.
The spelling of 2172127669 in words is "two billion, one hundred seventy-two million, one hundred twenty-seven thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •