Base | Representation |
---|---|
bin | 1001011010110… |
… | …1000111100001 |
3 | 2202100010121001 |
4 | 2112231013201 |
5 | 40103201101 |
6 | 3530432001 |
7 | 656541004 |
oct | 226550741 |
9 | 82303531 |
10 | 39506401 |
11 | 20333820 |
12 | 11292601 |
13 | 8252c8c |
14 | 536553b |
15 | 3705901 |
hex | 25ad1e1 |
39506401 has 8 divisors (see below), whose sum is σ = 43196544. Its totient is φ = 35832720.
The previous prime is 39506353. The next prime is 39506413. The reversal of 39506401 is 10460593.
39506401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 39506401 - 29 = 39505889 is a prime.
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 39506401.
It is not an unprimeable number, because it can be changed into a prime (39506471) 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, 1215 + ... + 8971.
It is an arithmetic number, because the mean of its divisors is an integer number (5399568).
Almost surely, 239506401 is an apocalyptic number.
It is an amenable number.
39506401 is a deficient number, since it is larger than the sum of its proper divisors (3690143).
39506401 is a wasteful number, since it uses less digits than its factorization.
39506401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8231.
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 39506401 is about 6285.4117605770. The cubic root of 39506401 is about 340.5826256072.
Adding to 39506401 its reverse (10460593), we get a palindrome (49966994).
The spelling of 39506401 in words is "thirty-nine million, five hundred six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •