Base | Representation |
---|---|
bin | 111000110111001100… |
… | …0011111111010000111 |
3 | 102200012010101112101000 |
4 | 1301232120133322013 |
5 | 4000040404001244 |
6 | 132032542304343 |
7 | 11552011242636 |
oct | 1615630377207 |
9 | 380163345330 |
10 | 122111000199 |
11 | 47872526891 |
12 | 1b7ba8880b3 |
13 | b690657106 |
14 | 5ca585751d |
15 | 329a492169 |
hex | 1c6e61fe87 |
122111000199 has 8 divisors (see below), whose sum is σ = 180905185520. Its totient is φ = 81407333448.
The previous prime is 122111000197. The next prime is 122111000233. The reversal of 122111000199 is 991000111221.
It is not a de Polignac number, because 122111000199 - 21 = 122111000197 is a prime.
It is a super-2 number, since 2×1221110001992 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 4522629637 = 122111000199 / (1 + 2 + 2 + 1 + 1 + 1 + 0 + 0 + 0 + 1 + 9 + 9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122111000197) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2261314792 + ... + 2261314845.
It is an arithmetic number, because the mean of its divisors is an integer number (22613148190).
Almost surely, 2122111000199 is an apocalyptic number.
122111000199 is a deficient number, since it is larger than the sum of its proper divisors (58794185321).
122111000199 is an equidigital number, since it uses as much as digits as its factorization.
122111000199 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4522629646 (or 4522629640 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 27.
The spelling of 122111000199 in words is "one hundred twenty-two billion, one hundred eleven million, one hundred ninety-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •