Base | Representation |
---|---|
bin | 111000110110111001… |
… | …1100110001100100111 |
3 | 102200011110012001201201 |
4 | 1301231303212030213 |
5 | 4000030414423011 |
6 | 132031555103331 |
7 | 11551533103054 |
oct | 1615563461447 |
9 | 380143161651 |
10 | 122101326631 |
11 | 478680199a9 |
12 | 1b7b75a1b47 |
13 | b68b64accb |
14 | 5ca445a02b |
15 | 32996d0cc1 |
hex | 1c6dce6327 |
122101326631 has 8 divisors (see below), whose sum is σ = 122405932880. Its totient is φ = 121796825472.
The previous prime is 122101326629. The next prime is 122101326653. The reversal of 122101326631 is 136623101221.
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 122101326631 - 21 = 122101326629 is a prime.
It is a super-2 number, since 2×1221013266312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 122101326631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122101326661) 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, 2632600 + ... + 2678578.
It is an arithmetic number, because the mean of its divisors is an integer number (15300741610).
Almost surely, 2122101326631 is an apocalyptic number.
122101326631 is a deficient number, since it is larger than the sum of its proper divisors (304606249).
122101326631 is an equidigital number, since it uses as much as digits as its factorization.
122101326631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52545.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 122101326631 its reverse (136623101221), we get a palindrome (258724427852).
The spelling of 122101326631 in words is "one hundred twenty-two billion, one hundred one million, three hundred twenty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •