Base | Representation |
---|---|
bin | 110011101111011101… |
… | …1001110100010110110 |
3 | 101121210202001202121020 |
4 | 1213132323032202312 |
5 | 3310030222003142 |
6 | 123013432002010 |
7 | 11012341354650 |
oct | 1473673164266 |
9 | 347722052536 |
10 | 111114250422 |
11 | 4313a108a2a |
12 | 1964bb30306 |
13 | a62a2c9c96 |
14 | 55411916d0 |
15 | 2d54d45cec |
hex | 19deece8b6 |
111114250422 has 32 divisors (see below), whose sum is σ = 254020250112. Its totient is φ = 31741326144.
The previous prime is 111114250397. The next prime is 111114250427. The reversal of 111114250422 is 224052411111.
111114250422 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 111114250392 and 111114250401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111114250427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10383 + ... + 471525.
It is an arithmetic number, because the mean of its divisors is an integer number (7938132816).
Almost surely, 2111114250422 is an apocalyptic number.
111114250422 is an abundant number, since it is smaller than the sum of its proper divisors (142905999690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111114250422 is a wasteful number, since it uses less digits than its factorization.
111114250422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466892.
The product of its (nonzero) digits is 640, while the sum is 24.
Adding to 111114250422 its reverse (224052411111), we get a palindrome (335166661533).
The spelling of 111114250422 in words is "one hundred eleven billion, one hundred fourteen million, two hundred fifty thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •