Base | Representation |
---|---|
bin | 110011110101101100… |
… | …0101100000010110110 |
3 | 101122100022102120202000 |
4 | 1213223120230002312 |
5 | 3310442231100042 |
6 | 123050300400130 |
7 | 11020460303004 |
oct | 1475330540266 |
9 | 348308376660 |
10 | 111323300022 |
11 | 43237111aa0 |
12 | 196a9b46046 |
13 | a66170237c |
14 | 5560c4ba74 |
15 | 2d6838b74c |
hex | 19eb62c0b6 |
111323300022 has 64 divisors (see below), whose sum is σ = 276150885120. Its totient is φ = 32949806400.
The previous prime is 111323299993. The next prime is 111323300027. The reversal of 111323300022 is 220003323111.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 111323299968 and 111323300004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111323300027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2153679 + ... + 2204762.
It is an arithmetic number, because the mean of its divisors is an integer number (4314857580).
Almost surely, 2111323300022 is an apocalyptic number.
111323300022 is an abundant number, since it is smaller than the sum of its proper divisors (164827585098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111323300022 is a wasteful number, since it uses less digits than its factorization.
111323300022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4358506 (or 4358500 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 111323300022 its reverse (220003323111), we get a palindrome (331326623133).
The spelling of 111323300022 in words is "one hundred eleven billion, three hundred twenty-three million, three hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •