Base | Representation |
---|---|
bin | 1001001000110101000… |
… | …01110001001111011011 |
3 | 1010000102122101100222101 |
4 | 10210122201301033123 |
5 | 20121011241011132 |
6 | 400123411104231 |
7 | 31453442116531 |
oct | 4443241611733 |
9 | 1100378340871 |
10 | 313977672667 |
11 | 11118023569a |
12 | 50a265a2077 |
13 | 237b9920c39 |
14 | 112a7686151 |
15 | 82798817e7 |
hex | 491a8713db |
313977672667 has 4 divisors (see below), whose sum is σ = 314194659376. Its totient is φ = 313760685960.
The previous prime is 313977672647. The next prime is 313977672677. The reversal of 313977672667 is 766276779313.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 766276779313 = 231547 ⋅3309379.
It is a cyclic number.
It is not a de Polignac number, because 313977672667 - 211 = 313977670619 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 313977672599 and 313977672608.
It is not an unprimeable number, because it can be changed into a prime (313977672647) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 108491184 + ... + 108494077.
It is an arithmetic number, because the mean of its divisors is an integer number (78548664844).
Almost surely, 2313977672667 is an apocalyptic number.
313977672667 is a deficient number, since it is larger than the sum of its proper divisors (216986709).
313977672667 is a wasteful number, since it uses less digits than its factorization.
313977672667 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216986708.
The product of its digits is 84015792, while the sum is 64.
The spelling of 313977672667 in words is "three hundred thirteen billion, nine hundred seventy-seven million, six hundred seventy-two thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •