Base | Representation |
---|---|
bin | 100100110001111000… |
… | …000000101111110101 |
3 | 10202221020011122201221 |
4 | 210301320000233311 |
5 | 1121334304103443 |
6 | 30050411150341 |
7 | 2565430655653 |
oct | 446170005765 |
9 | 122836148657 |
10 | 39491472373 |
11 | 158259a7781 |
12 | 77a17453b1 |
13 | 3954902b42 |
14 | 1ca8c35dd3 |
15 | 1062036eed |
hex | 931e00bf5 |
39491472373 has 2 divisors, whose sum is σ = 39491472374. Its totient is φ = 39491472372.
The previous prime is 39491472341. The next prime is 39491472403. The reversal of 39491472373 is 37327419493.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30591059409 + 8900412964 = 174903^2 + 94342^2 .
It is a cyclic number.
It is not a de Polignac number, because 39491472373 - 25 = 39491472341 is a prime.
It is a super-2 number, since 2×394914723732 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 39491472373.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (39491472323) 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, 19745736186 + 19745736187.
It is an arithmetic number, because the mean of its divisors is an integer number (19745736187).
Almost surely, 239491472373 is an apocalyptic number.
It is an amenable number.
39491472373 is a deficient number, since it is larger than the sum of its proper divisors (1).
39491472373 is an equidigital number, since it uses as much as digits as its factorization.
39491472373 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3429216, while the sum is 52.
The spelling of 39491472373 in words is "thirty-nine billion, four hundred ninety-one million, four hundred seventy-two thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •