Base | Representation |
---|---|
bin | 11011101111010110011000… |
… | …111001010011000100000010 |
3 | 120222222012012012112200202011 |
4 | 123233112120321103010002 |
5 | 111442331233431400002 |
6 | 1111250311534443134 |
7 | 34461201160553326 |
oct | 3357263071230402 |
9 | 528865165480664 |
10 | 122001111200002 |
11 | 3596742078a001 |
12 | 118247713634aa |
13 | 530c869c63828 |
14 | 221ac57335986 |
15 | e187dee7c8d7 |
hex | 6ef598e53102 |
122001111200002 has 8 divisors (see below), whose sum is σ = 183064403067516. Its totient is φ = 60979643510832.
The previous prime is 122001111199939. The next prime is 122001111200009. The reversal of 122001111200002 is 200002111100221.
It can be written as a sum of positive squares in 2 ways, for example, as 101715716747241 + 20285394452761 = 10085421^2 + 4503931^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1220011112000022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (122001111200009) 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 3 ways as a sum of consecutive naturals, for example, 10456037293 + ... + 10456048960.
Almost surely, 2122001111200002 is an apocalyptic number.
122001111200002 is a deficient number, since it is larger than the sum of its proper divisors (61063291867514).
122001111200002 is a wasteful number, since it uses less digits than its factorization.
122001111200002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20912089172.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 122001111200002 its reverse (200002111100221), we get a palindrome (322003222300223).
The spelling of 122001111200002 in words is "one hundred twenty-two trillion, one billion, one hundred eleven million, two hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •