Base | Representation |
---|---|
bin | 10010001010000111100101… |
… | …01000001000110111111111 |
3 | 12020101021112101111220022222 |
4 | 21011003302220020313333 |
5 | 20213203304131420444 |
6 | 220531343433155555 |
7 | 11260565524633622 |
oct | 1105036250106777 |
9 | 166337471456288 |
10 | 39930086591999 |
11 | 117a52889a693a |
12 | 458a87525bbbb |
13 | 193851107aaa6 |
14 | 9c08ab1a3db9 |
15 | 493a17012eee |
hex | 2450f2a08dff |
39930086591999 has 2 divisors, whose sum is σ = 39930086592000. Its totient is φ = 39930086591998.
The previous prime is 39930086591977. The next prime is 39930086592089. The reversal of 39930086591999 is 99919568003993.
39930086591999 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (99919568003993) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 39930086591999 - 28 = 39930086591743 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (39930086521999) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 19965043295999 + 19965043296000.
It is an arithmetic number, because the mean of its divisors is an integer number (19965043296000).
Almost surely, 239930086591999 is an apocalyptic number.
39930086591999 is a deficient number, since it is larger than the sum of its proper divisors (1).
39930086591999 is an equidigital number, since it uses as much as digits as its factorization.
39930086591999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1147912560, while the sum is 80.
The spelling of 39930086591999 in words is "thirty-nine trillion, nine hundred thirty billion, eighty-six million, five hundred ninety-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •