Base | Representation |
---|---|
bin | 11011101111010110011000… |
… | …010110111101110011000001 |
3 | 120222222012011120121110001210 |
4 | 123233112120112331303001 |
5 | 111442331224130400001 |
6 | 1111250311013520333 |
7 | 34461201021220263 |
oct | 3357263026756301 |
9 | 528865146543053 |
10 | 122001102200001 |
11 | 359674166a2192 |
12 | 1182476a3430a9 |
13 | 530c86813219b |
14 | 221ac56071b33 |
15 | e187de2a0dd6 |
hex | 6ef5985bdcc1 |
122001102200001 has 8 divisors (see below), whose sum is σ = 163608414511680. Its totient is φ = 80863929010832.
The previous prime is 122001102199931. The next prime is 122001102200069. The reversal of 122001102200001 is 100002201100221.
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 122001102200001 - 210 = 122001102198977 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122001102200001.
It is not an unprimeable number, because it can be changed into a prime (122001102207001) 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, 117534780021 + ... + 117534781058.
It is an arithmetic number, because the mean of its divisors is an integer number (20451051813960).
Almost surely, 2122001102200001 is an apocalyptic number.
It is an amenable number.
122001102200001 is a deficient number, since it is larger than the sum of its proper divisors (41607312311679).
122001102200001 is a wasteful number, since it uses less digits than its factorization.
122001102200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235069561255.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 122001102200001 its reverse (100002201100221), we get a palindrome (222003303300222).
The spelling of 122001102200001 in words is "one hundred twenty-two trillion, one billion, one hundred two million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •