Base | Representation |
---|---|
bin | 100011011001000101101000… |
… | …0101101000100001101010001 |
3 | 1111211021001221020000212100101 |
4 | 1012302023100231010031101 |
5 | 311301011041140221223 |
6 | 3022034240241452401 |
7 | 122400333514001662 |
oct | 10662132055041521 |
9 | 1454231836025311 |
10 | 311311321023313 |
11 | 90214431937046 |
12 | 2aaba277641101 |
13 | 104926bac31020 |
14 | 56c37968a7369 |
15 | 25ecdc65294ad |
hex | 11b22d0b44351 |
311311321023313 has 8 divisors (see below), whose sum is σ = 337315145386688. Its totient is φ = 285601325184144.
The previous prime is 311311321023299. The next prime is 311311321023317. The reversal of 311311321023313 is 313320123113113.
It is a happy number.
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 311311321023313 - 241 = 309112297767761 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (311311321023317) 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, 73457128845 + ... + 73457133082.
It is an arithmetic number, because the mean of its divisors is an integer number (42164393173336).
Almost surely, 2311311321023313 is an apocalyptic number.
It is an amenable number.
311311321023313 is a deficient number, since it is larger than the sum of its proper divisors (26003824363375).
311311321023313 is a wasteful number, since it uses less digits than its factorization.
311311321023313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146914262103.
The product of its (nonzero) digits is 2916, while the sum is 28.
Adding to 311311321023313 its reverse (313320123113113), we get a palindrome (624631444136426).
The spelling of 311311321023313 in words is "three hundred eleven trillion, three hundred eleven billion, three hundred twenty-one million, twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •