Base | Representation |
---|---|
bin | 11011101111101001111011… |
… | …111111000100011100011000 |
3 | 121000001012101000120112022212 |
4 | 123233221323333010130120 |
5 | 111443202230324311300 |
6 | 1111304102423134252 |
7 | 34462543262161256 |
oct | 3357517377043430 |
9 | 530035330515285 |
10 | 122022101010200 |
11 | 35975311a02086 |
12 | 1182884a8a4388 |
13 | 531183371b571 |
14 | 221bc88c755d6 |
15 | e1911ca65935 |
hex | 6efa7bfc4718 |
122022101010200 has 96 divisors (see below), whose sum is σ = 287321101158000. Its totient is φ = 48189973593600.
The previous prime is 122022101010181. The next prime is 122022101010209. The reversal of 122022101010200 is 2010101220221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122022101010209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7093295 + ... + 17156894.
Almost surely, 2122022101010200 is an apocalyptic number.
122022101010200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122022101010200 is an abundant number, since it is smaller than the sum of its proper divisors (165299000147800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122022101010200 is a wasteful number, since it uses less digits than its factorization.
122022101010200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24250525 (or 24250516 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 122022101010200 its reverse (2010101220221), we get a palindrome (124032202230421).
The spelling of 122022101010200 in words is "one hundred twenty-two trillion, twenty-two billion, one hundred one million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •