Base | Representation |
---|---|
bin | 110011110010100111… |
… | …1000000101110100000 |
3 | 101122002010020110220222 |
4 | 1213211033000232200 |
5 | 3310234321200000 |
6 | 123032132422212 |
7 | 11015065152212 |
oct | 1474517005640 |
9 | 348063213828 |
10 | 111220100000 |
11 | 43193935319 |
12 | 1967b477968 |
13 | a64620b179 |
14 | 55512665b2 |
15 | 2d5e2a3a85 |
hex | 19e53c0ba0 |
111220100000 has 72 divisors (see below), whose sum is σ = 273688443756. Its totient is φ = 44488000000.
The previous prime is 111220099999. The next prime is 111220100003. The reversal of 111220100000 is 1022111.
It can be written as a sum of positive squares in 6 ways, for example, as 17948496784 + 93271603216 = 133972^2 + 305404^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is not an unprimeable number, because it can be changed into a prime (111220100003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 456101 + ... + 656100.
Almost surely, 2111220100000 is an apocalyptic number.
111220100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111220100000 is an abundant number, since it is smaller than the sum of its proper divisors (162468343756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111220100000 is an frugal number, since it uses more digits than its factorization.
111220100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1112236 (or 1112208 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 111220100000 its reverse (1022111), we get a palindrome (111221122111).
The spelling of 111220100000 in words is "one hundred eleven billion, two hundred twenty million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •