Base | Representation |
---|---|
bin | 1001000011011110010… |
… | …00000100010111011001 |
3 | 1002202000020100122122100 |
4 | 10201233020010113121 |
5 | 20044114110000241 |
6 | 354530204114013 |
7 | 31322253430524 |
oct | 4415710042731 |
9 | 1082006318570 |
10 | 311102031321 |
11 | 10aa34a937a4 |
12 | 50363535909 |
13 | 2344bc2b503 |
14 | 110b37b1bbb |
15 | 815c1a49b6 |
hex | 486f2045d9 |
311102031321 has 24 divisors (see below), whose sum is σ = 457075794240. Its totient is φ = 203862304800.
The previous prime is 311102031287. The next prime is 311102031341. The reversal of 311102031321 is 123130201113.
311102031321 is a `hidden beast` number, since 31 + 110 + 203 + 1 + 321 = 666.
It is not a de Polignac number, because 311102031321 - 27 = 311102031193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 311102031294 and 311102031303.
It is not an unprimeable number, because it can be changed into a prime (311102031341) 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 23 ways as a sum of consecutive naturals, for example, 523926 + ... + 946943.
It is an arithmetic number, because the mean of its divisors is an integer number (19044824760).
Almost surely, 2311102031321 is an apocalyptic number.
It is an amenable number.
311102031321 is a deficient number, since it is larger than the sum of its proper divisors (145973762919).
311102031321 is a wasteful number, since it uses less digits than its factorization.
311102031321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1471277 (or 1471274 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 311102031321 its reverse (123130201113), we get a palindrome (434232232434).
The spelling of 311102031321 in words is "three hundred eleven billion, one hundred two million, thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •