Base | Representation |
---|---|
bin | 111000111010010001… |
… | …0101101101100110111 |
3 | 102200110022211210220001 |
4 | 1301310202231230313 |
5 | 4000243332411211 |
6 | 132051113252131 |
7 | 11554404522220 |
oct | 1616442555467 |
9 | 380408753801 |
10 | 122214341431 |
11 | 4791589a666 |
12 | 1b829404047 |
13 | b6a8b9a680 |
14 | 5cb5478247 |
15 | 32a45a6ac1 |
hex | 1c748adb37 |
122214341431 has 8 divisors (see below), whose sum is σ = 150417651104. Its totient is φ = 96697061280.
The previous prime is 122214341413. The next prime is 122214341461. The reversal of 122214341431 is 134143412221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122214341431 - 25 = 122214341399 is a prime.
It is a super-2 number, since 2×1222143414312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 122214341431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122214341461) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 671507280 + ... + 671507461.
It is an arithmetic number, because the mean of its divisors is an integer number (18802206388).
Almost surely, 2122214341431 is an apocalyptic number.
122214341431 is a deficient number, since it is larger than the sum of its proper divisors (28203309673).
122214341431 is a wasteful number, since it uses less digits than its factorization.
122214341431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1343014761.
The product of its digits is 4608, while the sum is 28.
Adding to 122214341431 its reverse (134143412221), we get a palindrome (256357753652).
The spelling of 122214341431 in words is "one hundred twenty-two billion, two hundred fourteen million, three hundred forty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •