Base | Representation |
---|---|
bin | 100011111011001111010011… |
… | …0011011110001010110011001 |
3 | 1112102212210011112222200222001 |
4 | 1013312132212123301112121 |
5 | 312404411230320213311 |
6 | 3040030410433401001 |
7 | 123363415522246651 |
oct | 10766364633612631 |
9 | 1472783145880861 |
10 | 316005011101081 |
11 | 91763a77595345 |
12 | 2b537a7aa09161 |
13 | 107431b5b377a3 |
14 | 5806a1d0a5361 |
15 | 26800376354c1 |
hex | 11f67a66f1599 |
316005011101081 has 2 divisors, whose sum is σ = 316005011101082. Its totient is φ = 316005011101080.
The previous prime is 316005011101069. The next prime is 316005011101123. The reversal of 316005011101081 is 180101110500613.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 315854327388681 + 150683712400 = 17772291^2 + 388180^2 .
It is a cyclic number.
It is not a de Polignac number, because 316005011101081 - 213 = 316005011092889 is a prime.
It is a super-2 number, since 2×3160050111010812 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (316005011107081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 158002505550540 + 158002505550541.
It is an arithmetic number, because the mean of its divisors is an integer number (158002505550541).
Almost surely, 2316005011101081 is an apocalyptic number.
It is an amenable number.
316005011101081 is a deficient number, since it is larger than the sum of its proper divisors (1).
316005011101081 is an equidigital number, since it uses as much as digits as its factorization.
316005011101081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 720, while the sum is 28.
Adding to 316005011101081 its reverse (180101110500613), we get a palindrome (496106121601694).
The spelling of 316005011101081 in words is "three hundred sixteen trillion, five billion, eleven million, one hundred one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •