Base | Representation |
---|---|
bin | 1110100010110… |
… | …11101011011011 |
3 | 22111120202201011 |
4 | 13101123223123 |
5 | 222213312311 |
6 | 20035034351 |
7 | 3011033152 |
oct | 721335333 |
9 | 274522634 |
10 | 122010331 |
11 | 62965193 |
12 | 34a3b9b7 |
13 | 1c37bc81 |
14 | 122c0599 |
15 | aaa1321 |
hex | 745badb |
122010331 has 4 divisors (see below), whose sum is σ = 127315152. Its totient is φ = 116705512.
The previous prime is 122010313. The next prime is 122010353. The reversal of 122010331 is 133010221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 133010221 = 4093 ⋅32497.
It is a cyclic number.
It is not a de Polignac number, because 122010331 - 25 = 122010299 is a prime.
It is a super-2 number, since 2×1220103312 = 29773041741459122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122010391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2652376 + ... + 2652421.
It is an arithmetic number, because the mean of its divisors is an integer number (31828788).
Almost surely, 2122010331 is an apocalyptic number.
122010331 is a deficient number, since it is larger than the sum of its proper divisors (5304821).
122010331 is an equidigital number, since it uses as much as digits as its factorization.
122010331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5304820.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 122010331 is about 11045.8286696834. The cubic root of 122010331 is about 495.9815655545.
Adding to 122010331 its reverse (133010221), we get a palindrome (255020552).
The spelling of 122010331 in words is "one hundred twenty-two million, ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •