Base | Representation |
---|---|
bin | 100111011111001… |
… | …110001101111001 |
3 | 1201011121021211101 |
4 | 213133032031321 |
5 | 2324044333441 |
6 | 145423331401 |
7 | 22263060400 |
oct | 4737161571 |
9 | 1634537741 |
10 | 662496121 |
11 | 30aa64161 |
12 | 165a50b61 |
13 | a733aa51 |
14 | 63db4637 |
15 | 3d265231 |
hex | 277ce379 |
662496121 has 9 divisors (see below), whose sum is σ = 770868399. Its totient is φ = 567699384.
The previous prime is 662496091. The next prime is 662496127. The reversal of 662496121 is 121694266.
The square root of 662496121 is 25739.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 528770025 + 133726096 = 22995^2 + 11564^2 .
It is not a de Polignac number, because 662496121 - 25 = 662496089 is a prime.
It is a super-2 number, since 2×6624961212 = 877802220680093282, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (662496127) 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 in 8 ways as a sum of consecutive naturals, for example, 178335 + ... + 182011.
Almost surely, 2662496121 is an apocalyptic number.
662496121 is the 25739-th square number.
662496121 is the 12870-th centered octagonal number.
It is an amenable number.
662496121 is a deficient number, since it is larger than the sum of its proper divisors (108372278).
662496121 is an frugal number, since it uses more digits than its factorization.
662496121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7368 (or 3684 counting only the distinct ones).
The product of its digits is 31104, while the sum is 37.
The cubic root of 662496121 is about 871.7549992233.
The spelling of 662496121 in words is "six hundred sixty-two million, four hundred ninety-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •