Base | Representation |
---|---|
bin | 100100011000111000… |
… | …011011100110011001 |
3 | 10201212000010222021022 |
4 | 210120320123212121 |
5 | 1120004432330321 |
6 | 25541031452225 |
7 | 2552146545323 |
oct | 443070334631 |
9 | 121760128238 |
10 | 39072151961 |
11 | 15630236087 |
12 | 76a5227075 |
13 | 38b8a8855b |
14 | 1c69282613 |
15 | 103a308dab |
hex | 918e1b999 |
39072151961 has 2 divisors, whose sum is σ = 39072151962. Its totient is φ = 39072151960.
The previous prime is 39072151957. The next prime is 39072151981. The reversal of 39072151961 is 16915127093.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 38728272025 + 343879936 = 196795^2 + 18544^2 .
It is a cyclic number.
It is not a de Polignac number, because 39072151961 - 22 = 39072151957 is a prime.
It is a super-2 number, since 2×390721519612 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (39072151981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 19536075980 + 19536075981.
It is an arithmetic number, because the mean of its divisors is an integer number (19536075981).
Almost surely, 239072151961 is an apocalyptic number.
It is an amenable number.
39072151961 is a deficient number, since it is larger than the sum of its proper divisors (1).
39072151961 is an equidigital number, since it uses as much as digits as its factorization.
39072151961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 102060, while the sum is 44.
The spelling of 39072151961 in words is "thirty-nine billion, seventy-two million, one hundred fifty-one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •