Base | Representation |
---|---|
bin | 110011110010111110… |
… | …0011101001011011110 |
3 | 101122002221122201112000 |
4 | 1213211330131023132 |
5 | 3310300343404042 |
6 | 123033240023130 |
7 | 11015301340104 |
oct | 1474574351336 |
9 | 348087581460 |
10 | 111232013022 |
11 | 4319a631799 |
12 | 19683461aa6 |
13 | a64881c6b0 |
14 | 5552a87c74 |
15 | 2d6035874c |
hex | 19e5f1d2de |
111232013022 has 32 divisors (see below), whose sum is σ = 266196272160. Its totient is φ = 34225234560.
The previous prime is 111232012999. The next prime is 111232013023. The reversal of 111232013022 is 220310232111.
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 = 111232012986 and 111232013004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111232013023) 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, 79224379 + ... + 79225782.
It is an arithmetic number, because the mean of its divisors is an integer number (8318633505).
Almost surely, 2111232013022 is an apocalyptic number.
111232013022 is an abundant number, since it is smaller than the sum of its proper divisors (154964259138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111232013022 is a wasteful number, since it uses less digits than its factorization.
111232013022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158450185 (or 158450179 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 111232013022 its reverse (220310232111), we get a palindrome (331542245133).
The spelling of 111232013022 in words is "one hundred eleven billion, two hundred thirty-two million, thirteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •