Base | Representation |
---|---|
bin | 1110100011000… |
… | …00101001101101 |
3 | 22111121210122121 |
4 | 13101200221231 |
5 | 222214440301 |
6 | 20035312541 |
7 | 3011146432 |
oct | 721405155 |
9 | 274553577 |
10 | 122030701 |
11 | 62979521 |
12 | 34a4b751 |
13 | 1c388320 |
14 | 122c7b89 |
15 | aaa73a1 |
hex | 7460a6d |
122030701 has 4 divisors (see below), whose sum is σ = 131417692. Its totient is φ = 112643712.
The previous prime is 122030693. The next prime is 122030707. The reversal of 122030701 is 107030221.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 58446025 + 63584676 = 7645^2 + 7974^2 .
It is a cyclic number.
It is not a de Polignac number, because 122030701 - 23 = 122030693 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122030707) 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 3 ways as a sum of consecutive naturals, for example, 4693476 + ... + 4693501.
It is an arithmetic number, because the mean of its divisors is an integer number (32854423).
Almost surely, 2122030701 is an apocalyptic number.
It is an amenable number.
122030701 is a deficient number, since it is larger than the sum of its proper divisors (9386991).
122030701 is an equidigital number, since it uses as much as digits as its factorization.
122030701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9386990.
The product of its (nonzero) digits is 84, while the sum is 16.
The square root of 122030701 is about 11046.7506987349. The cubic root of 122030701 is about 496.0091659011.
Adding to 122030701 its reverse (107030221), we get a palindrome (229060922).
The spelling of 122030701 in words is "one hundred twenty-two million, thirty thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •