Base | Representation |
---|---|
bin | 1110100100101… |
… | …00100100000011 |
3 | 22112000121022210 |
4 | 13102110210003 |
5 | 222243241311 |
6 | 20044033203 |
7 | 3013023360 |
oct | 722244403 |
9 | 275017283 |
10 | 122243331 |
11 | 63004251 |
12 | 34b32803 |
13 | 1c431042 |
14 | 12341467 |
15 | aaea3a6 |
hex | 7494903 |
122243331 has 16 divisors (see below), whose sum is σ = 186673664. Its totient is φ = 69704064.
The previous prime is 122243299. The next prime is 122243333. The reversal of 122243331 is 133342221.
It is not a de Polignac number, because 122243331 - 25 = 122243299 is a prime.
It is a super-2 number, since 2×1222433312 = 29886863947951122, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122243298 and 122243307.
It is not an unprimeable number, because it can be changed into a prime (122243333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4251 + ... + 16203.
It is an arithmetic number, because the mean of its divisors is an integer number (11667104).
Almost surely, 2122243331 is an apocalyptic number.
122243331 is a deficient number, since it is larger than the sum of its proper divisors (64430333).
122243331 is a wasteful number, since it uses less digits than its factorization.
122243331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12450.
The product of its digits is 864, while the sum is 21.
The square root of 122243331 is about 11056.3706070301. The cubic root of 122243331 is about 496.2970858845.
Adding to 122243331 its reverse (133342221), we get a palindrome (255585552).
The spelling of 122243331 in words is "one hundred twenty-two million, two hundred forty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •