Base | Representation |
---|---|
bin | 11011110000111011110011… |
… | …001110111010111100001000 |
3 | 121000100121020220220200022001 |
4 | 123300323303032322330020 |
5 | 112001122240224001300 |
6 | 1111412320545040344 |
7 | 34502104441566553 |
oct | 3360736316727410 |
9 | 530317226820261 |
10 | 122110001000200 |
11 | 359a9619188614 |
12 | 118418a03260b4 |
13 | 5319c0144b275 |
14 | 2222226cc369a |
15 | e1b56487716a |
hex | 6f0ef33baf08 |
122110001000200 has 48 divisors (see below), whose sum is σ = 283906539058500. Its totient is φ = 48843865048320.
The previous prime is 122110001000191. The next prime is 122110001000213. The reversal of 122110001000200 is 2000100011221.
It can be written as a sum of positive squares in 6 ways, for example, as 42511521447396 + 79598479552804 = 6520086^2 + 8921798^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 103772746 + ... + 104942854.
Almost surely, 2122110001000200 is an apocalyptic number.
122110001000200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122110001000200 is an abundant number, since it is smaller than the sum of its proper divisors (161796538058300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122110001000200 is a wasteful number, since it uses less digits than its factorization.
122110001000200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1691914 (or 1691905 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 122110001000200 its reverse (2000100011221), we get a palindrome (124110101011421).
The spelling of 122110001000200 in words is "one hundred twenty-two trillion, one hundred ten billion, one million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •