Base | Representation |
---|---|
bin | 111000111010110001… |
… | …1011110110111010101 |
3 | 102200111111210102010201 |
4 | 1301311203132313111 |
5 | 4000312204220041 |
6 | 132052521220501 |
7 | 11555002035406 |
oct | 1616543366725 |
9 | 380444712121 |
10 | 122231320021 |
11 | 47924436958 |
12 | 1b833031731 |
13 | b6ac563785 |
14 | 5cb78179ad |
15 | 32a5d0c631 |
hex | 1c758dedd5 |
122231320021 has 8 divisors (see below), whose sum is σ = 123805082880. Its totient is φ = 120658220592.
The previous prime is 122231319967. The next prime is 122231320093. The reversal of 122231320021 is 120023132221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122231320021 - 219 = 122230795733 is a prime.
It is a super-2 number, since 2×1222313200212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122231320721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 210456 + ... + 537358.
It is an arithmetic number, because the mean of its divisors is an integer number (15475635360).
Almost surely, 2122231320021 is an apocalyptic number.
It is an amenable number.
122231320021 is a deficient number, since it is larger than the sum of its proper divisors (1573762859).
122231320021 is an equidigital number, since it uses as much as digits as its factorization.
122231320021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 331715.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 122231320021 its reverse (120023132221), we get a palindrome (242254452242).
The spelling of 122231320021 in words is "one hundred twenty-two billion, two hundred thirty-one million, three hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •