Base | Representation |
---|---|
bin | 110100001010011101… |
… | …0110001100011001010 |
3 | 101201010212120202102120 |
4 | 1220110322301203022 |
5 | 3313404121220242 |
6 | 123243351312110 |
7 | 11043651102453 |
oct | 1502472614312 |
9 | 351125522376 |
10 | 112020101322 |
11 | 43564477138 |
12 | 1986337b636 |
13 | a742b9182c |
14 | 55c95d212a |
15 | 2da962b1ec |
hex | 1a14eb18ca |
112020101322 has 16 divisors (see below), whose sum is σ = 230095343712. Its totient is φ = 36330843600.
The previous prime is 112020101321. The next prime is 112020101341. The reversal of 112020101322 is 223101020211.
112020101322 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1120201013222 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112020101321) by changing a digit.
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, 252297304 + ... + 252297747.
It is an arithmetic number, because the mean of its divisors is an integer number (14380958982).
Almost surely, 2112020101322 is an apocalyptic number.
112020101322 is an abundant number, since it is smaller than the sum of its proper divisors (118075242390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112020101322 is a wasteful number, since it uses less digits than its factorization.
112020101322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504595093.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 112020101322 its reverse (223101020211), we get a palindrome (335121121533).
The spelling of 112020101322 in words is "one hundred twelve billion, twenty million, one hundred one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •