Base | Representation |
---|---|
bin | 1110100100011… |
… | …01100010000011 |
3 | 22111222010211010 |
4 | 13102031202003 |
5 | 222241331111 |
6 | 20043252003 |
7 | 3012543405 |
oct | 722154203 |
9 | 274863733 |
10 | 122214531 |
11 | 62a9464a |
12 | 34b1a003 |
13 | 1c420bba |
14 | 12334b75 |
15 | aae1aa6 |
hex | 748d883 |
122214531 has 4 divisors (see below), whose sum is σ = 162952712. Its totient is φ = 81476352.
The previous prime is 122214511. The next prime is 122214539. The reversal of 122214531 is 135412221.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 122214531 - 26 = 122214467 is a prime.
It is a super-2 number, since 2×1222145312 = 29872783175099922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122214498 and 122214507.
It is not an unprimeable number, because it can be changed into a prime (122214539) 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, 20369086 + ... + 20369091.
It is an arithmetic number, because the mean of its divisors is an integer number (40738178).
Almost surely, 2122214531 is an apocalyptic number.
122214531 is a deficient number, since it is larger than the sum of its proper divisors (40738181).
122214531 is an equidigital number, since it uses as much as digits as its factorization.
122214531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40738180.
The product of its digits is 480, while the sum is 21.
The square root of 122214531 is about 11055.0681137657. The cubic root of 122214531 is about 496.2581076744.
Adding to 122214531 its reverse (135412221), we get a palindrome (257626752).
It can be divided in two parts, 1222 and 14531, that added together give a triangular number (15753 = T177).
The spelling of 122214531 in words is "one hundred twenty-two million, two hundred fourteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •