Base | Representation |
---|---|
bin | 111000111000000110… |
… | …0010010110000101111 |
3 | 102200021020111201101221 |
4 | 1301300030102300233 |
5 | 4000121141330210 |
6 | 132035545044211 |
7 | 11552530250026 |
oct | 1616014226057 |
9 | 380236451357 |
10 | 122141355055 |
11 | 47888679945 |
12 | 1b808a86667 |
13 | b696a24775 |
14 | 5ca98b98bd |
15 | 329ce8b1da |
hex | 1c70312c2f |
122141355055 has 8 divisors (see below), whose sum is σ = 146622960000. Its totient is φ = 97677528096.
The previous prime is 122141355043. The next prime is 122141355079. The reversal of 122141355055 is 550553141221.
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 122141355055 - 25 = 122141355023 is a prime.
It is a super-2 number, since 2×1221413550552 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 122141355055.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4429375 + ... + 4456864.
It is an arithmetic number, because the mean of its divisors is an integer number (18327870000).
Almost surely, 2122141355055 is an apocalyptic number.
122141355055 is a deficient number, since it is larger than the sum of its proper divisors (24481604945).
122141355055 is an equidigital number, since it uses as much as digits as its factorization.
122141355055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8888993.
The product of its (nonzero) digits is 30000, while the sum is 34.
Adding to 122141355055 its reverse (550553141221), we get a palindrome (672694496276).
The spelling of 122141355055 in words is "one hundred twenty-two billion, one hundred forty-one million, three hundred fifty-five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •