Base | Representation |
---|---|
bin | 1001001110001001000… |
… | …11001010100101010011 |
3 | 1010021210102212000021211 |
4 | 10213010203022211103 |
5 | 20142332010242311 |
6 | 401314430000551 |
7 | 31614226653631 |
oct | 4470443124523 |
9 | 1107712760254 |
10 | 316830165331 |
11 | 112404406649 |
12 | 514a1946157 |
13 | 23b5289a014 |
14 | 11498452351 |
15 | 8394ed9821 |
hex | 49c48ca953 |
316830165331 has 2 divisors, whose sum is σ = 316830165332. Its totient is φ = 316830165330.
The previous prime is 316830165319. The next prime is 316830165371. The reversal of 316830165331 is 133561038613.
It is an a-pointer prime, because the next prime (316830165371) can be obtained adding 316830165331 to its sum of digits (40).
It is a weak prime.
It is an emirp because it is prime and its reverse (133561038613) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 316830165331 - 219 = 316829641043 is a prime.
It is a super-2 number, since 2×3168301653312 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (316830165371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 158415082665 + 158415082666.
It is an arithmetic number, because the mean of its divisors is an integer number (158415082666).
Almost surely, 2316830165331 is an apocalyptic number.
316830165331 is a deficient number, since it is larger than the sum of its proper divisors (1).
316830165331 is an equidigital number, since it uses as much as digits as its factorization.
316830165331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116640, while the sum is 40.
The spelling of 316830165331 in words is "three hundred sixteen billion, eight hundred thirty million, one hundred sixty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •