Base | Representation |
---|---|
bin | 1001010100111… |
… | …0000001110001 |
3 | 2201121100022120 |
4 | 2111032001301 |
5 | 40003220123 |
6 | 3514224453 |
7 | 653326323 |
oct | 225160161 |
9 | 81540276 |
10 | 39116913 |
11 | 20098130 |
12 | 11125129 |
13 | 8147904 |
14 | 52a3613 |
15 | 367a2e3 |
hex | 254e071 |
39116913 has 8 divisors (see below), whose sum is σ = 56897376. Its totient is φ = 23707200.
The previous prime is 39116893. The next prime is 39116923. The reversal of 39116913 is 31961193.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 39116913 - 29 = 39116401 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 1185361 = 39116913 / (3 + 9 + 1 + 1 + 6 + 9 + 1 + 3).
It is not an unprimeable number, because it can be changed into a prime (39116923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 592648 + ... + 592713.
It is an arithmetic number, because the mean of its divisors is an integer number (7112172).
Almost surely, 239116913 is an apocalyptic number.
39116913 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
39116913 is a deficient number, since it is larger than the sum of its proper divisors (17780463).
39116913 is a wasteful number, since it uses less digits than its factorization.
39116913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1185375.
The product of its digits is 4374, while the sum is 33.
The square root of 39116913 is about 6254.3515251383. The cubic root of 39116913 is about 339.4596752245.
The spelling of 39116913 in words is "thirty-nine million, one hundred sixteen thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •