Base | Representation |
---|---|
bin | 1001000100010001101… |
… | …11111100110010101101 |
3 | 1002210010100012121221111 |
4 | 10202020313330302231 |
5 | 20101010201413423 |
6 | 355041115032021 |
7 | 31336050265234 |
oct | 4421067746255 |
9 | 1083110177844 |
10 | 311534013613 |
11 | 110136913459 |
12 | 5046413b611 |
13 | 234ba58a134 |
14 | 11114cddb1b |
15 | 818508460d |
hex | 4888dfccad |
311534013613 has 4 divisors (see below), whose sum is σ = 313597152928. Its totient is φ = 309470874300.
The previous prime is 311534013611. The next prime is 311534013649. The reversal of 311534013613 is 316310435113.
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, and also an emirpimes, since its reverse is a distinct semiprime: 316310435113 = 31 ⋅10203562423.
It is a cyclic number.
It is not a de Polignac number, because 311534013613 - 21 = 311534013611 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311534013611) 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, 1031569431 + ... + 1031569732.
It is an arithmetic number, because the mean of its divisors is an integer number (78399288232).
Almost surely, 2311534013613 is an apocalyptic number.
It is an amenable number.
311534013613 is a deficient number, since it is larger than the sum of its proper divisors (2063139315).
311534013613 is a wasteful number, since it uses less digits than its factorization.
311534013613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2063139314.
The product of its (nonzero) digits is 9720, while the sum is 31.
Adding to 311534013613 its reverse (316310435113), we get a palindrome (627844448726).
The spelling of 311534013613 in words is "three hundred eleven billion, five hundred thirty-four million, thirteen thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •