Base | Representation |
---|---|
bin | 111000111010010001… |
… | …0111100010100101001 |
3 | 102200110022221212001012 |
4 | 1301310202330110221 |
5 | 4000243341320241 |
6 | 132051114433305 |
7 | 11554405161635 |
oct | 1616442742451 |
9 | 380408855035 |
10 | 122214401321 |
11 | 47915930661 |
12 | 1b829432835 |
13 | b6a8bbb9cc |
14 | 5cb5491dc5 |
15 | 32a45b96eb |
hex | 1c748bc529 |
122214401321 has 4 divisors (see below), whose sum is σ = 122215277652. Its totient is φ = 122213524992.
The previous prime is 122214401311. The next prime is 122214401357. The reversal of 122214401321 is 123104412221.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 101419319296 + 20795082025 = 318464^2 + 144205^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122214401321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122214401311) 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, 177140 + ... + 525173.
It is an arithmetic number, because the mean of its divisors is an integer number (30553819413).
Almost surely, 2122214401321 is an apocalyptic number.
It is an amenable number.
122214401321 is a deficient number, since it is larger than the sum of its proper divisors (876331).
122214401321 is an equidigital number, since it uses as much as digits as its factorization.
122214401321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 876330.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 122214401321 its reverse (123104412221), we get a palindrome (245318813542).
The spelling of 122214401321 in words is "one hundred twenty-two billion, two hundred fourteen million, four hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •