Base | Representation |
---|---|
bin | 11001001111011100000110… |
… | …000110010010001001011000 |
3 | 112120001122200122200010110212 |
4 | 121033130012012102021120 |
5 | 104022310311213311300 |
6 | 1032034133111030252 |
7 | 32245234604615315 |
oct | 3117340606221130 |
9 | 476048618603425 |
10 | 111012122010200 |
11 | 3240aa81881834 |
12 | 1054aa8706b388 |
13 | 49c3523a806a8 |
14 | 1d5b030285d0c |
15 | cc7a3029a935 |
hex | 64f706192258 |
111012122010200 has 96 divisors (see below), whose sum is σ = 258611298598800. Its totient is φ = 44317454039040.
The previous prime is 111012122010199. The next prime is 111012122010203. The reversal of 111012122010200 is 2010221210111.
111012122010200 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111012122010203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 823605212 + ... + 823739988.
Almost surely, 2111012122010200 is an apocalyptic number.
111012122010200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111012122010200 is an abundant number, since it is smaller than the sum of its proper divisors (147599176588600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111012122010200 is a wasteful number, since it uses less digits than its factorization.
111012122010200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142869 (or 142860 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 111012122010200 its reverse (2010221210111), we get a palindrome (113022343220311).
The spelling of 111012122010200 in words is "one hundred eleven trillion, twelve billion, one hundred twenty-two million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •