Base | Representation |
---|---|
bin | 110011111000000001… |
… | …0010111000100011110 |
3 | 101122112202021001220010 |
4 | 1213300002113010132 |
5 | 3311122220124042 |
6 | 123102125104050 |
7 | 11022425464320 |
oct | 1476002270436 |
9 | 348482231803 |
10 | 111401333022 |
11 | 4327716a381 |
12 | 197100b8026 |
13 | a674924345 |
14 | 556b361610 |
15 | 2d7015259c |
hex | 19f009711e |
111401333022 has 16 divisors (see below), whose sum is σ = 254631618432. Its totient is φ = 31828952280.
The previous prime is 111401333009. The next prime is 111401333039. The reversal of 111401333022 is 220333104111.
111401333022 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 111401333022.
It is a congruent number.
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, 1326206304 + ... + 1326206387.
It is an arithmetic number, because the mean of its divisors is an integer number (15914476152).
Almost surely, 2111401333022 is an apocalyptic number.
111401333022 is an abundant number, since it is smaller than the sum of its proper divisors (143230285410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111401333022 is a wasteful number, since it uses less digits than its factorization.
111401333022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2652412703.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 111401333022 its reverse (220333104111), we get a palindrome (331734437133).
The spelling of 111401333022 in words is "one hundred eleven billion, four hundred one million, three hundred thirty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •