Base | Representation |
---|---|
bin | 1001000011111000011… |
… | …00100011001101000111 |
3 | 1002202120111222011110202 |
4 | 10201330030203031013 |
5 | 20100041223410043 |
6 | 355004040041115 |
7 | 31330555321163 |
oct | 4417414431507 |
9 | 1082514864422 |
10 | 311321310023 |
11 | 110037844069 |
12 | 50404a6319b |
13 | 234854a5819 |
14 | 110d4971ca3 |
15 | 817156b1b8 |
hex | 487c323347 |
311321310023 has 4 divisors (see below), whose sum is σ = 322056527640. Its totient is φ = 300586092408.
The previous prime is 311321310011. The next prime is 311321310037. The reversal of 311321310023 is 320013123113.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320013123113 = 49547 ⋅6458779.
It is a cyclic number.
It is not a de Polignac number, because 311321310023 - 214 = 311321293639 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 311321309977 and 311321310004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311321300023) 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, 5367608765 + ... + 5367608822.
It is an arithmetic number, because the mean of its divisors is an integer number (80514131910).
Almost surely, 2311321310023 is an apocalyptic number.
311321310023 is a deficient number, since it is larger than the sum of its proper divisors (10735217617).
311321310023 is a wasteful number, since it uses less digits than its factorization.
311321310023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10735217616.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 311321310023 its reverse (320013123113), we get a palindrome (631334433136).
The spelling of 311321310023 in words is "three hundred eleven billion, three hundred twenty-one million, three hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •