Base | Representation |
---|---|
bin | 1110100101100… |
… | …01101000001101 |
3 | 22112020122122001 |
4 | 13102301220031 |
5 | 222311044011 |
6 | 20050352301 |
7 | 3014030431 |
oct | 722615015 |
9 | 275218561 |
10 | 122362381 |
11 | 63085739 |
12 | 34b8b691 |
13 | 1c47329b |
14 | 123729c1 |
15 | ab207c1 |
hex | 74b1a0d |
122362381 has 8 divisors (see below), whose sum is σ = 124768440. Its totient is φ = 119976192.
The previous prime is 122362351. The next prime is 122362393. The reversal of 122362381 is 183263221.
It can be written as a sum of positive squares in 4 ways, for example, as 50282281 + 72080100 = 7091^2 + 8490^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122362381 - 25 = 122362349 is a prime.
It is a super-2 number, since 2×1223623812 = 29945104567978322, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122362351) 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 in 7 ways as a sum of consecutive naturals, for example, 7785 + ... + 17473.
It is an arithmetic number, because the mean of its divisors is an integer number (15596055).
Almost surely, 2122362381 is an apocalyptic number.
It is an amenable number.
122362381 is a deficient number, since it is larger than the sum of its proper divisors (2406059).
122362381 is an equidigital number, since it uses as much as digits as its factorization.
122362381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9935.
The product of its digits is 3456, while the sum is 28.
The square root of 122362381 is about 11061.7530708292. The cubic root of 122362381 is about 496.4581444271.
The spelling of 122362381 in words is "one hundred twenty-two million, three hundred sixty-two thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •