Base | Representation |
---|---|
bin | 100100110001110000… |
… | …110111110010000001 |
3 | 10202221002122120012112 |
4 | 210301300313302001 |
5 | 1121333314210031 |
6 | 30050303105105 |
7 | 2565406032011 |
oct | 446160676201 |
9 | 122832576175 |
10 | 39489600641 |
11 | 15824939497 |
12 | 77a0ba2195 |
13 | 39543c8bca |
14 | 1ca88a9c41 |
15 | 1061cb762b |
hex | 931c37c81 |
39489600641 has 4 divisors (see below), whose sum is σ = 39497347284. Its totient is φ = 39481854000.
The previous prime is 39489600637. The next prime is 39489600691. The reversal of 39489600641 is 14600698493.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6181890625 + 33307710016 = 78625^2 + 182504^2 .
It is a cyclic number.
It is not a de Polignac number, because 39489600641 - 22 = 39489600637 is a prime.
It is a super-2 number, since 2×394896006412 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 39489600641.
It is not an unprimeable number, because it can be changed into a prime (39489600691) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3865670 + ... + 3875871.
It is an arithmetic number, because the mean of its divisors is an integer number (9874336821).
Almost surely, 239489600641 is an apocalyptic number.
It is an amenable number.
39489600641 is a deficient number, since it is larger than the sum of its proper divisors (7746643).
39489600641 is an equidigital number, since it uses as much as digits as its factorization.
39489600641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7746642.
The product of its (nonzero) digits is 1119744, while the sum is 50.
The spelling of 39489600641 in words is "thirty-nine billion, four hundred eighty-nine million, six hundred thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •