Base | Representation |
---|---|
bin | 111000110111001010… |
… | …1011100100110001001 |
3 | 102200012001212212222110 |
4 | 1301232111130212021 |
5 | 4000040202401301 |
6 | 132032513212533 |
7 | 11552001401403 |
oct | 1615625344611 |
9 | 380161785873 |
10 | 122110200201 |
11 | 4787202a830 |
12 | 1b7ba561149 |
13 | b690436c42 |
14 | 5ca56c9b73 |
15 | 329a3850d6 |
hex | 1c6e55c989 |
122110200201 has 32 divisors (see below), whose sum is σ = 188096214528. Its totient is φ = 69640490240.
The previous prime is 122110200193. The next prime is 122110200203. The reversal of 122110200201 is 102002011221.
It is a cyclic number.
It is not a de Polignac number, because 122110200201 - 23 = 122110200193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (122110200203) 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 31 ways as a sum of consecutive naturals, for example, 3814006 + ... + 3845888.
It is an arithmetic number, because the mean of its divisors is an integer number (5878006704).
Almost surely, 2122110200201 is an apocalyptic number.
122110200201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122110200201 is a deficient number, since it is larger than the sum of its proper divisors (65986014327).
122110200201 is a wasteful number, since it uses less digits than its factorization.
122110200201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38741.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 122110200201 its reverse (102002011221), we get a palindrome (224112211422).
It can be divided in two parts, 1221 and 10200201, that multiplied together give a palindrome (12454445421).
The spelling of 122110200201 in words is "one hundred twenty-two billion, one hundred ten million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •