Base | Representation |
---|---|
bin | 1011010000100010… |
… | …0001010110111101 |
3 | 21210121200020122121 |
4 | 2310020201112331 |
5 | 22142131221134 |
6 | 1215514442541 |
7 | 134614463263 |
oct | 26410412675 |
9 | 7717606577 |
10 | 3022132669 |
11 | 1310a08006 |
12 | 704133451 |
13 | 3921635aa |
14 | 209528433 |
15 | 12a4b6ab4 |
hex | b42215bd |
3022132669 has 2 divisors, whose sum is σ = 3022132670. Its totient is φ = 3022132668.
The previous prime is 3022132667. The next prime is 3022132691. The reversal of 3022132669 is 9662312203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2364876900 + 657255769 = 48630^2 + 25637^2 .
It is an emirp because it is prime and its reverse (9662312203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3022132669 - 21 = 3022132667 is a prime.
It is a super-2 number, since 2×30221326692 = 18266571738074127122, which contains 22 as substring.
Together with 3022132667, 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 (3022132661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1511066334 + 1511066335.
It is an arithmetic number, because the mean of its divisors is an integer number (1511066335).
Almost surely, 23022132669 is an apocalyptic number.
It is an amenable number.
3022132669 is a deficient number, since it is larger than the sum of its proper divisors (1).
3022132669 is an equidigital number, since it uses as much as digits as its factorization.
3022132669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 34.
The square root of 3022132669 is about 54973.9271746162. The cubic root of 3022132669 is about 1445.7876428935.
The spelling of 3022132669 in words is "three billion, twenty-two million, one hundred thirty-two thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •