Base | Representation |
---|---|
bin | 1110100011101… |
… | …00110000101101 |
3 | 22111202222122021 |
4 | 13101310300231 |
5 | 222230104234 |
6 | 20041150141 |
7 | 3011641531 |
oct | 721646055 |
9 | 274688567 |
10 | 122113069 |
11 | 62a253a1 |
12 | 34a8b351 |
13 | 1c3b6970 |
14 | 12309bc1 |
15 | aac19b4 |
hex | 7474c2d |
122113069 has 4 divisors (see below), whose sum is σ = 131506396. Its totient is φ = 112719744.
The previous prime is 122112979. The next prime is 122113087. The reversal of 122113069 is 960311221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 960311221 = 23291 ⋅41231.
It can be written as a sum of positive squares in 2 ways, for example, as 22372900 + 99740169 = 4730^2 + 9987^2 .
It is a cyclic number.
It is not a de Polignac number, because 122113069 - 211 = 122111021 is a prime.
It is a super-2 number, since 2×1221130692 = 29823203241197522, 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 (122113469) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4696644 + ... + 4696669.
It is an arithmetic number, because the mean of its divisors is an integer number (32876599).
Almost surely, 2122113069 is an apocalyptic number.
It is an amenable number.
122113069 is a deficient number, since it is larger than the sum of its proper divisors (9393327).
122113069 is an equidigital number, since it uses as much as digits as its factorization.
122113069 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9393326.
The product of its (nonzero) digits is 648, while the sum is 25.
The square root of 122113069 is about 11050.4782249457. The cubic root of 122113069 is about 496.1207391745.
The spelling of 122113069 in words is "one hundred twenty-two million, one hundred thirteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •