Base | Representation |
---|---|
bin | 100101000111011000… |
… | …011011010001111101 |
3 | 10210212101010011010002 |
4 | 211013120123101331 |
5 | 1123104141304242 |
6 | 30150300524045 |
7 | 2610401612615 |
oct | 450730332175 |
9 | 123771104102 |
10 | 39852291197 |
11 | 159a0641254 |
12 | 7882550625 |
13 | 39b15a64c4 |
14 | 1d00b1ba45 |
15 | 1083a5b432 |
hex | 94761b47d |
39852291197 has 2 divisors, whose sum is σ = 39852291198. Its totient is φ = 39852291196.
The previous prime is 39852291179. The next prime is 39852291233. The reversal of 39852291197 is 79119225893.
Together with previous prime (39852291179) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29848090756 + 10004200441 = 172766^2 + 100021^2 .
It is a cyclic number.
It is not a de Polignac number, because 39852291197 - 216 = 39852225661 is a prime.
It is a super-2 number, since 2×398522911972 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (39852231197) 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, 19926145598 + 19926145599.
It is an arithmetic number, because the mean of its divisors is an integer number (19926145599).
Almost surely, 239852291197 is an apocalyptic number.
It is an amenable number.
39852291197 is a deficient number, since it is larger than the sum of its proper divisors (1).
39852291197 is an equidigital number, since it uses as much as digits as its factorization.
39852291197 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2449440, while the sum is 56.
The spelling of 39852291197 in words is "thirty-nine billion, eight hundred fifty-two million, two hundred ninety-one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •