Base | Representation |
---|---|
bin | 1001000011101001111… |
… | …10001101011000100000 |
3 | 1002202021001220120110011 |
4 | 10201310332031120200 |
5 | 20044314212010422 |
6 | 354544030214304 |
7 | 31324554201523 |
oct | 4416476153040 |
9 | 1082231816404 |
10 | 311200110112 |
11 | 10aa85392851 |
12 | 50390354394 |
13 | 2346634b6b8 |
14 | 110c2822bba |
15 | 8165aca077 |
hex | 4874f8d620 |
311200110112 has 12 divisors (see below), whose sum is σ = 612675216846. Its totient is φ = 155600055040.
The previous prime is 311200110103. The next prime is 311200110113. The reversal of 311200110112 is 211011002113.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 176302573456 + 134897536656 = 419884^2 + 367284^2 .
It is a junction number, because it is equal to n+sod(n) for n = 311200110092 and 311200110101.
It is not an unprimeable number, because it can be changed into a prime (311200110113) 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 as a sum of consecutive naturals, namely, 4862501689 + ... + 4862501752.
Almost surely, 2311200110112 is an apocalyptic number.
311200110112 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
311200110112 is a deficient number, since it is larger than the sum of its proper divisors (301475106734).
311200110112 is an equidigital number, since it uses as much as digits as its factorization.
311200110112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9725003451 (or 9725003443 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 311200110112 its reverse (211011002113), we get a palindrome (522211112225).
The spelling of 311200110112 in words is "three hundred eleven billion, two hundred million, one hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •