Base | Representation |
---|---|
bin | 110011110010111010… |
… | …1100101000001001000 |
3 | 101122002211021010101212 |
4 | 1213211311211001020 |
5 | 3310244413210440 |
6 | 123033133232252 |
7 | 11015250120611 |
oct | 1474565450110 |
9 | 348084233355 |
10 | 111230210120 |
11 | 43199610197 |
12 | 19682932688 |
13 | a64833aba3 |
14 | 5552738c08 |
15 | 2d600ee465 |
hex | 19e5d65048 |
111230210120 has 32 divisors (see below), whose sum is σ = 250278449400. Its totient is φ = 44490221568.
The previous prime is 111230210107. The next prime is 111230210149. The reversal of 111230210120 is 21012032111.
It can be written as a sum of positive squares in 4 ways, for example, as 22076610724 + 89153599396 = 148582^2 + 298586^2 .
It is a junction number, because it is equal to n+sod(n) for n = 111230210095 and 111230210104.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1301342 + ... + 1384178.
Almost surely, 2111230210120 is an apocalyptic number.
111230210120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111230210120 is an abundant number, since it is smaller than the sum of its proper divisors (139048239280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111230210120 is a wasteful number, since it uses less digits than its factorization.
111230210120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116417 (or 116413 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 111230210120 its reverse (21012032111), we get a palindrome (132242242231).
The spelling of 111230210120 in words is "one hundred eleven billion, two hundred thirty million, two hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •