Base | Representation |
---|---|
bin | 100011011001111001001010… |
… | …1101100101101011101110001 |
3 | 1111211122122121122110211001122 |
4 | 1012303302111230231131301 |
5 | 311304314224024132423 |
6 | 3022201143013112025 |
7 | 122411332323455462 |
oct | 10663622554553561 |
9 | 1454578548424048 |
10 | 311422000224113 |
11 | 9025736840a829 |
12 | 2ab17805928615 |
13 | 1049cc7906719c |
14 | 56c8c95d6cd69 |
15 | 2600c030868c8 |
hex | 11b3c95b2d771 |
311422000224113 has 8 divisors (see below), whose sum is σ = 311440344396480. Its totient is φ = 311403656620720.
The previous prime is 311422000224103. The next prime is 311422000224157.
It is a happy number.
311422000224113 is nontrivially palindromic in base 10.
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 311422000224113 - 248 = 29947023513457 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (311422000224103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1550103398 + ... + 1550304288.
It is an arithmetic number, because the mean of its divisors is an integer number (38930043049560).
Almost surely, 2311422000224113 is an apocalyptic number.
It is an amenable number.
311422000224113 is a deficient number, since it is larger than the sum of its proper divisors (18344172367).
311422000224113 is a wasteful number, since it uses less digits than its factorization.
311422000224113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284487.
The product of its (nonzero) digits is 2304, while the sum is 26.
It can be divided in two parts, 311422000 and 224113, that added together give a palindrome (311646113).
The spelling of 311422000224113 in words is "three hundred eleven trillion, four hundred twenty-two billion, two hundred twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •