Base | Representation |
---|---|
bin | 100011010111001000001110… |
… | …1001111001100110101011001 |
3 | 1111210022022211022121010211012 |
4 | 1012232100131033030311121 |
5 | 311232103030124202223 |
6 | 3021310422103143305 |
7 | 122342021160633410 |
oct | 10656203517146531 |
9 | 1453268738533735 |
10 | 311042022100313 |
11 | 901201a9699359 |
12 | 2aa7603ba44b35 |
13 | 104731a17c2b8a |
14 | 56b472ad48477 |
15 | 25e5db42cac78 |
hex | 11ae41d3ccd59 |
311042022100313 has 4 divisors (see below), whose sum is σ = 355476596686080. Its totient is φ = 266607447514548.
The previous prime is 311042022100267. The next prime is 311042022100331. The reversal of 311042022100313 is 313001220240113.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a de Polignac number, because none of the positive numbers 2k-311042022100313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (311042022100013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22217287292873 + ... + 22217287292886.
It is an arithmetic number, because the mean of its divisors is an integer number (88869149171520).
Almost surely, 2311042022100313 is an apocalyptic number.
It is an amenable number.
311042022100313 is a deficient number, since it is larger than the sum of its proper divisors (44434574585767).
311042022100313 is an equidigital number, since it uses as much as digits as its factorization.
311042022100313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44434574585766.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 311042022100313 its reverse (313001220240113), we get a palindrome (624043242340426).
The spelling of 311042022100313 in words is "three hundred eleven trillion, forty-two billion, twenty-two million, one hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •