Base | Representation |
---|---|
bin | 11010011000000111001001… |
… | …011011001010100000010001 |
3 | 120012202002011010100111020022 |
4 | 122120013021123022200101 |
5 | 110201121044131221433 |
6 | 1050420253504553225 |
7 | 33302111365144235 |
oct | 3230071133124021 |
9 | 505662133314208 |
10 | 116006151038993 |
11 | 33a65a28a95246 |
12 | 11016929322815 |
13 | 4c96443aa0aa7 |
14 | 2090a28a185c5 |
15 | d628bd6ba698 |
hex | 6981c96ca811 |
116006151038993 has 2 divisors, whose sum is σ = 116006151038994. Its totient is φ = 116006151038992.
The previous prime is 116006151038971. The next prime is 116006151039043. The reversal of 116006151038993 is 399830151600611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80324022242689 + 35682128796304 = 8962367^2 + 5973452^2 .
It is an emirp because it is prime and its reverse (399830151600611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 116006151038993 - 218 = 116006150776849 is a prime.
It is not a weakly prime, because it can be changed into another prime (116005151038993) 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 as a sum of consecutive naturals, namely, 58003075519496 + 58003075519497.
It is an arithmetic number, because the mean of its divisors is an integer number (58003075519497).
Almost surely, 2116006151038993 is an apocalyptic number.
It is an amenable number.
116006151038993 is a deficient number, since it is larger than the sum of its proper divisors (1).
116006151038993 is an equidigital number, since it uses as much as digits as its factorization.
116006151038993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1049760, while the sum is 53.
The spelling of 116006151038993 in words is "one hundred sixteen trillion, six billion, one hundred fifty-one million, thirty-eight thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •