Base | Representation |
---|---|
bin | 111000111001110110… |
… | …0011001000011101100 |
3 | 102200102100001022211101 |
4 | 1301303230121003230 |
5 | 4000231211213400 |
6 | 132045444132444 |
7 | 11554142502220 |
oct | 1616354310354 |
9 | 380370038741 |
10 | 122200101100 |
11 | 479088536a0 |
12 | 1b824697124 |
13 | b6a5c52a3c |
14 | 5cb360c780 |
15 | 32a31e256a |
hex | 1c73b190ec |
122200101100 has 72 divisors (see below), whose sum is σ = 330606839808. Its totient is φ = 38088340800.
The previous prime is 122200101083. The next prime is 122200101103. The reversal of 122200101100 is 1101002221.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (122200101103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7927372 + ... + 7942771.
It is an arithmetic number, because the mean of its divisors is an integer number (4591761664).
Almost surely, 2122200101100 is an apocalyptic number.
122200101100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122200101100 is an abundant number, since it is smaller than the sum of its proper divisors (208406738708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122200101100 is a wasteful number, since it uses less digits than its factorization.
122200101100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15870175 (or 15870168 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 122200101100 its reverse (1101002221), we get a palindrome (123301103321).
The spelling of 122200101100 in words is "one hundred twenty-two billion, two hundred million, one hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •