Base | Representation |
---|---|
bin | 11011101111100000101111… |
… | …000010000011000111111001 |
3 | 121000000020212101201202121120 |
4 | 123233200233002003013321 |
5 | 111443022011310323001 |
6 | 1111255350131055453 |
7 | 34462043361106365 |
oct | 3357405702030771 |
9 | 530006771652546 |
10 | 122012220011001 |
11 | 35971101387141 |
12 | 11826951741589 |
13 | 531091a598288 |
14 | 221b5cc84c2a5 |
15 | e18c40362236 |
hex | 6ef82f0831f9 |
122012220011001 has 8 divisors (see below), whose sum is σ = 167930797434624. Its totient is φ = 78717561297360.
The previous prime is 122012220010997. The next prime is 122012220011009. The reversal of 122012220011001 is 100110022210221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122012220011001 - 22 = 122012220010997 is a prime.
It is a super-2 number, since 2×1220122200110012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (122012220011009) 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, 655979677386 + ... + 655979677571.
It is an arithmetic number, because the mean of its divisors is an integer number (20991349679328).
Almost surely, 2122012220011001 is an apocalyptic number.
It is an amenable number.
122012220011001 is a deficient number, since it is larger than the sum of its proper divisors (45918577423623).
122012220011001 is a wasteful number, since it uses less digits than its factorization.
122012220011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1311959354991.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122012220011001 its reverse (100110022210221), we get a palindrome (222122242221222).
The spelling of 122012220011001 in words is "one hundred twenty-two trillion, twelve billion, two hundred twenty million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •