Base | Representation |
---|---|
bin | 111000111101001101… |
… | …1100100110011110101 |
3 | 102200201012201221212012 |
4 | 1301322123210303311 |
5 | 4000444130231201 |
6 | 132105002534005 |
7 | 11560014323162 |
oct | 1617233446365 |
9 | 380635657765 |
10 | 122313133301 |
11 | 47966636437 |
12 | 1b856507305 |
13 | b6c34aa2b8 |
14 | 5cc4633069 |
15 | 32ad0bd5bb |
hex | 1c7a6e4cf5 |
122313133301 has 4 divisors (see below), whose sum is σ = 122861622912. Its totient is φ = 121764643692.
The previous prime is 122313133237. The next prime is 122313133307. The reversal of 122313133301 is 103331313221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 103331313221 = 227 ⋅455204023.
It is a cyclic number.
It is not a de Polignac number, because 122313133301 - 26 = 122313133237 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 (122313133307) 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, 274244471 + ... + 274244916.
It is an arithmetic number, because the mean of its divisors is an integer number (30715405728).
Almost surely, 2122313133301 is an apocalyptic number.
It is an amenable number.
122313133301 is a deficient number, since it is larger than the sum of its proper divisors (548489611).
122313133301 is an equidigital number, since it uses as much as digits as its factorization.
122313133301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 548489610.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 122313133301 its reverse (103331313221), we get a palindrome (225644446522).
The spelling of 122313133301 in words is "one hundred twenty-two billion, three hundred thirteen million, one hundred thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •