Base | Representation |
---|---|
bin | 100100101110110101… |
… | …100001000000000001 |
3 | 10202210200020022010121 |
4 | 210232311201000001 |
5 | 1121233231031101 |
6 | 30041350300241 |
7 | 2564241413551 |
oct | 445665410001 |
9 | 122720208117 |
10 | 39440486401 |
11 | 157aa143208 |
12 | 7788657681 |
13 | 3947190a24 |
14 | 1ca2163161 |
15 | 105c8150a1 |
hex | 92ed61001 |
39440486401 has 8 divisors (see below), whose sum is σ = 39723652800. Its totient is φ = 39158170128.
The previous prime is 39440486383. The next prime is 39440486419. The reversal of 39440486401 is 10468404493.
It is an interprime number because it is at equal distance from previous prime (39440486383) and next prime (39440486419).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 39440486401 - 217 = 39440355329 is a prime.
It is a super-3 number, since 3×394404864013 (a number of 33 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (39440486431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 119266 + ... + 305131.
It is an arithmetic number, because the mean of its divisors is an integer number (4965456600).
Almost surely, 239440486401 is an apocalyptic number.
It is an amenable number.
39440486401 is a deficient number, since it is larger than the sum of its proper divisors (283166399).
39440486401 is a wasteful number, since it uses less digits than its factorization.
39440486401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425063.
The product of its (nonzero) digits is 331776, while the sum is 43.
The spelling of 39440486401 in words is "thirty-nine billion, four hundred forty million, four hundred eighty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •