Base | Representation |
---|---|
bin | 11111001000001… |
… | …001000110011010 |
3 | 1100101122221022022 |
4 | 133020021012122 |
5 | 2032142244442 |
6 | 123453054442 |
7 | 15640602653 |
oct | 3710110632 |
9 | 1311587268 |
10 | 522228122 |
11 | 248869799 |
12 | 126a87422 |
13 | 84268730 |
14 | 4d50052a |
15 | 30ca93d2 |
hex | 1f20919a |
522228122 has 8 divisors (see below), whose sum is σ = 843599316. Its totient is φ = 241028352.
The previous prime is 522228097. The next prime is 522228197. The reversal of 522228122 is 221822225.
It can be written as a sum of positive squares in 2 ways, for example, as 522076801 + 151321 = 22849^2 + 389^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×5222281222 = 545444422815293768, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 20085697 = 522228122 / (5 + 2 + 2 + 2 + 2 + 8 + 1 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 522228091 and 522228100.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 10042823 + ... + 10042874.
Almost surely, 2522228122 is an apocalyptic number.
522228122 is a deficient number, since it is larger than the sum of its proper divisors (321371194).
522228122 is a wasteful number, since it uses less digits than its factorization.
522228122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20085712.
The product of its digits is 2560, while the sum is 26.
The square root of 522228122 is about 22852.3110866275. The cubic root of 522228122 is about 805.2920622788.
The spelling of 522228122 in words is "five hundred twenty-two million, two hundred twenty-eight thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •