Base | Representation |
---|---|
bin | 110100001001111001… |
… | …1011100110110100010 |
3 | 101201002120101211222002 |
4 | 1220103303130312202 |
5 | 3313334324414242 |
6 | 123241442444002 |
7 | 11043333141323 |
oct | 1502363346642 |
9 | 351076354862 |
10 | 112001404322 |
11 | 43554966875 |
12 | 19859063602 |
13 | a73c046512 |
14 | 55c6d2644a |
15 | 2da7b86432 |
hex | 1a13cdcda2 |
112001404322 has 8 divisors (see below), whose sum is σ = 168038476572. Its totient is φ = 55988578800.
The previous prime is 112001404321. The next prime is 112001404357. The reversal of 112001404322 is 223404100211.
112001404322 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 105247687561 + 6753716761 = 324419^2 + 82181^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 112001404294 and 112001404303.
It is not an unprimeable number, because it can be changed into a prime (112001404321) 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 3 ways as a sum of consecutive naturals, for example, 6050129 + ... + 6068612.
Almost surely, 2112001404322 is an apocalyptic number.
112001404322 is a deficient number, since it is larger than the sum of its proper divisors (56037072250).
112001404322 is a wasteful number, since it uses less digits than its factorization.
112001404322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12123364.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 112001404322 its reverse (223404100211), we get a palindrome (335405504533).
The spelling of 112001404322 in words is "one hundred twelve billion, one million, four hundred four thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •