Base | Representation |
---|---|
bin | 100011111110010000110010… |
… | …0010110010111010011000111 |
3 | 1112111100111122200101212100101 |
4 | 1013330201210112113103013 |
5 | 312433213203114340421 |
6 | 3040545324423224531 |
7 | 123435425213404105 |
oct | 10774414426272307 |
9 | 1474314580355311 |
10 | 316420514215111 |
11 | 91904206232779 |
12 | 2b5a44b9ba8147 |
13 | 107734322c7487 |
14 | 581cb98214c75 |
15 | 268ac550c4191 |
hex | 11fc8645974c7 |
316420514215111 has 2 divisors, whose sum is σ = 316420514215112. Its totient is φ = 316420514215110.
The previous prime is 316420514215073. The next prime is 316420514215153. The reversal of 316420514215111 is 111512415024613.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 316420514215111 - 241 = 314221490959559 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (316420514215511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 158210257107555 + 158210257107556.
It is an arithmetic number, because the mean of its divisors is an integer number (158210257107556).
Almost surely, 2316420514215111 is an apocalyptic number.
316420514215111 is a deficient number, since it is larger than the sum of its proper divisors (1).
316420514215111 is an equidigital number, since it uses as much as digits as its factorization.
316420514215111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 37.
Adding to 316420514215111 its reverse (111512415024613), we get a palindrome (427932929239724).
The spelling of 316420514215111 in words is "three hundred sixteen trillion, four hundred twenty billion, five hundred fourteen million, two hundred fifteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •