Base | Representation |
---|---|
bin | 11011110000111110101011… |
… | …111101001000000010001000 |
3 | 121000100220020220110021201021 |
4 | 123300332223331020002020 |
5 | 112001200112112321300 |
6 | 1111413552254002224 |
7 | 34502244312641050 |
oct | 3360765375100210 |
9 | 530326226407637 |
10 | 122113100120200 |
11 | 359aa969599312 |
12 | 118424061a6374 |
13 | 531a2a6528897 |
14 | 222243c72c560 |
15 | e1b696999d1a |
hex | 6f0fabf48088 |
122113100120200 has 48 divisors (see below), whose sum is σ = 324471951751680. Its totient is φ = 41867348612160.
The previous prime is 122113100120183. The next prime is 122113100120213. The reversal of 122113100120200 is 2021001311221.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 43611820072 + ... + 43611822871.
It is an arithmetic number, because the mean of its divisors is an integer number (6759832328160).
Almost surely, 2122113100120200 is an apocalyptic number.
122113100120200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122113100120200 is an abundant number, since it is smaller than the sum of its proper divisors (202358851631480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122113100120200 is a wasteful number, since it uses less digits than its factorization.
122113100120200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87223642966 (or 87223642957 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 122113100120200 its reverse (2021001311221), we get a palindrome (124134101431421).
The spelling of 122113100120200 in words is "one hundred twenty-two trillion, one hundred thirteen billion, one hundred million, one hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •