Base | Representation |
---|---|
bin | 101100010101100111111001… |
… | …1100001110010111001011001 |
3 | 1220010212122011122002211011002 |
4 | 1120223033303201302321121 |
5 | 402104230000240221101 |
6 | 3501243305505314345 |
7 | 145101366410523065 |
oct | 13053176341627131 |
9 | 1803778148084132 |
10 | 390000001101401 |
11 | 1032a2087385129 |
12 | 378a87433359b5 |
13 | 1397cac46b9962 |
14 | 6c4415a724aa5 |
15 | 3014bdd356d6b |
hex | 162b3f3872e59 |
390000001101401 has 2 divisors, whose sum is σ = 390000001101402. Its totient is φ = 390000001101400.
The previous prime is 390000001101377. The next prime is 390000001101439. The reversal of 390000001101401 is 104101100000093.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 311005216915600 + 78994784185801 = 17635340^2 + 8887901^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-390000001101401 is a prime.
It is not a weakly prime, because it can be changed into another prime (390000001101461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 195000000550700 + 195000000550701.
It is an arithmetic number, because the mean of its divisors is an integer number (195000000550701).
Almost surely, 2390000001101401 is an apocalyptic number.
It is an amenable number.
390000001101401 is a deficient number, since it is larger than the sum of its proper divisors (1).
390000001101401 is an equidigital number, since it uses as much as digits as its factorization.
390000001101401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 390000001101401 its reverse (104101100000093), we get a palindrome (494101101101494).
The spelling of 390000001101401 in words is "three hundred ninety trillion, one million, one hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •