Base | Representation |
---|---|
bin | 1000011001000000… |
… | …0011110000111101 |
3 | 12210222012120111101 |
4 | 2012100003300331 |
5 | 14103100403134 |
6 | 1011255453101 |
7 | 106546500343 |
oct | 20620036075 |
9 | 5728176441 |
10 | 2252356669 |
11 | a5643a9a2 |
12 | 52a387191 |
13 | 29b833634 |
14 | 1751c9993 |
15 | d2b0ee14 |
hex | 86403c3d |
2252356669 has 2 divisors, whose sum is σ = 2252356670. Its totient is φ = 2252356668.
The previous prime is 2252356591. The next prime is 2252356699. The reversal of 2252356669 is 9666532522.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2059979769 + 192376900 = 45387^2 + 13870^2 .
It is a cyclic number.
It is not a de Polignac number, because 2252356669 - 29 = 2252356157 is a prime.
It is a super-2 number, since 2×22523566692 = 10146221128777551122, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2252356699) 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, 1126178334 + 1126178335.
It is an arithmetic number, because the mean of its divisors is an integer number (1126178335).
Almost surely, 22252356669 is an apocalyptic number.
It is an amenable number.
2252356669 is a deficient number, since it is larger than the sum of its proper divisors (1).
2252356669 is an equidigital number, since it uses as much as digits as its factorization.
2252356669 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1166400, while the sum is 46.
The square root of 2252356669 is about 47458.9998735751. Note that the first 3 decimals coincide. The cubic root of 2252356669 is about 1310.8280352462.
The spelling of 2252356669 in words is "two billion, two hundred fifty-two million, three hundred fifty-six thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •