Base | Representation |
---|---|
bin | 110100010101110100… |
… | …0111110001000000011 |
3 | 101202010102220011201022 |
4 | 1220223220332020003 |
5 | 3320144213411321 |
6 | 123345250100055 |
7 | 11056260241601 |
oct | 1505350761003 |
9 | 352112804638 |
10 | 112401310211 |
11 | 4373a678003 |
12 | 1994ab7a62b |
13 | a7a3b54018 |
14 | 56240a4871 |
15 | 2dccd2bdab |
hex | 1a2ba3e203 |
112401310211 has 8 divisors (see below), whose sum is σ = 115147564224. Its totient is φ = 109655282880.
The previous prime is 112401310207. The next prime is 112401310223. The reversal of 112401310211 is 112013104211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112401310211 - 22 = 112401310207 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112401310211.
It is not an unprimeable number, because it can be changed into a prime (112401310261) 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, 1396805 + ... + 1475081.
It is an arithmetic number, because the mean of its divisors is an integer number (14393445528).
Almost surely, 2112401310211 is an apocalyptic number.
112401310211 is a deficient number, since it is larger than the sum of its proper divisors (2746254013).
112401310211 is an equidigital number, since it uses as much as digits as its factorization.
112401310211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113341.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 112401310211 its reverse (112013104211), we get a palindrome (224414414422).
The spelling of 112401310211 in words is "one hundred twelve billion, four hundred one million, three hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •