Base | Representation |
---|---|
bin | 10010001010001011000011… |
… | …10001001011000001010111 |
3 | 12020101110100100011101021001 |
4 | 21011011201301023001113 |
5 | 20213221114003343223 |
6 | 220532252443004131 |
7 | 11260662656046253 |
oct | 1105054161130127 |
9 | 166343310141231 |
10 | 39931951231063 |
11 | 117a605549a861 |
12 | 458b0b5809647 |
13 | 193874a480508 |
14 | 9c0a06aa5263 |
15 | 493ac5a889ad |
hex | 245161c4b057 |
39931951231063 has 2 divisors, whose sum is σ = 39931951231064. Its totient is φ = 39931951231062.
The previous prime is 39931951231021. The next prime is 39931951231147. The reversal of 39931951231063 is 36013215913993.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 39931951231063 - 221 = 39931949133911 is a prime.
It is a super-2 number, since 2×399319512310632 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 39931951230995 and 39931951231013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (39931951231013) 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, 19965975615531 + 19965975615532.
It is an arithmetic number, because the mean of its divisors is an integer number (19965975615532).
Almost surely, 239931951231063 is an apocalyptic number.
39931951231063 is a deficient number, since it is larger than the sum of its proper divisors (1).
39931951231063 is an equidigital number, since it uses as much as digits as its factorization.
39931951231063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3542940, while the sum is 55.
The spelling of 39931951231063 in words is "thirty-nine trillion, nine hundred thirty-one billion, nine hundred fifty-one million, two hundred thirty-one thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •