Base | Representation |
---|---|
bin | 1001000111011111000… |
… | …10001111101001110101 |
3 | 1002221120101010202021011 |
4 | 10203233202033221311 |
5 | 20113022113030244 |
6 | 355524043152221 |
7 | 31426533161545 |
oct | 4435742175165 |
9 | 1087511122234 |
10 | 313256376949 |
11 | 11094007052a |
12 | 50864b15671 |
13 | 23703366739 |
14 | 11239967325 |
15 | 82363a4434 |
hex | 48ef88fa75 |
313256376949 has 2 divisors, whose sum is σ = 313256376950. Its totient is φ = 313256376948.
The previous prime is 313256376947. The next prime is 313256376977. The reversal of 313256376949 is 949673652313.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 178874014225 + 134382362724 = 422935^2 + 366582^2 .
It is an emirp because it is prime and its reverse (949673652313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 313256376949 - 21 = 313256376947 is a prime.
Together with 313256376947, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 313256376893 and 313256376902.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313256376947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156628188474 + 156628188475.
It is an arithmetic number, because the mean of its divisors is an integer number (156628188475).
Almost surely, 2313256376949 is an apocalyptic number.
It is an amenable number.
313256376949 is a deficient number, since it is larger than the sum of its proper divisors (1).
313256376949 is an equidigital number, since it uses as much as digits as its factorization.
313256376949 is an evil number, because the sum of its binary digits is even.
The product of its digits is 22044960, while the sum is 58.
The spelling of 313256376949 in words is "three hundred thirteen billion, two hundred fifty-six million, three hundred seventy-six thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •