Base | Representation |
---|---|
bin | 100100010100101011… |
… | …100100001100000001 |
3 | 10201200002112010202011 |
4 | 210110223210030001 |
5 | 1114333411423101 |
6 | 25530033052521 |
7 | 2550332504611 |
oct | 442453441401 |
9 | 121602463664 |
10 | 39001670401 |
11 | 155a4476261 |
12 | 76856b7141 |
13 | 38a72ab7a5 |
14 | 1c5db76a41 |
15 | 1034035751 |
hex | 914ae4301 |
39001670401 has 2 divisors, whose sum is σ = 39001670402. Its totient is φ = 39001670400.
The previous prime is 39001670381. The next prime is 39001670417. The reversal of 39001670401 is 10407610093.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36044921025 + 2956749376 = 189855^2 + 54376^2 .
It is an emirp because it is prime and its reverse (10407610093) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-39001670401 is a prime.
It is a super-2 number, since 2×390016704012 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (39001673401) 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 as a sum of consecutive naturals, namely, 19500835200 + 19500835201.
It is an arithmetic number, because the mean of its divisors is an integer number (19500835201).
Almost surely, 239001670401 is an apocalyptic number.
39001670401 is the 88320-th centered decagonal number.
It is an amenable number.
39001670401 is a deficient number, since it is larger than the sum of its proper divisors (1).
39001670401 is an equidigital number, since it uses as much as digits as its factorization.
39001670401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 31.
The spelling of 39001670401 in words is "thirty-nine billion, one million, six hundred seventy thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •