Base | Representation |
---|---|
bin | 10111010001100… |
… | …110111001011101 |
3 | 1000012210000222002 |
4 | 113101212321131 |
5 | 1244431213431 |
6 | 102425332045 |
7 | 12451060613 |
oct | 2721467135 |
9 | 1005700862 |
10 | 390491741 |
11 | 190471252 |
12 | aa937025 |
13 | 62b92803 |
14 | 39c0b6b3 |
15 | 244363cb |
hex | 17466e5d |
390491741 has 2 divisors, whose sum is σ = 390491742. Its totient is φ = 390491740.
The previous prime is 390491719. The next prime is 390491767. The reversal of 390491741 is 147194093.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 368832025 + 21659716 = 19205^2 + 4654^2 .
It is a cyclic number.
It is not a de Polignac number, because 390491741 - 222 = 386297437 is a prime.
It is a super-2 number, since 2×3904917412 = 304967599578422162, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 390491695 and 390491704.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (390491791) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 195245870 + 195245871.
It is an arithmetic number, because the mean of its divisors is an integer number (195245871).
Almost surely, 2390491741 is an apocalyptic number.
It is an amenable number.
390491741 is a deficient number, since it is larger than the sum of its proper divisors (1).
390491741 is an equidigital number, since it uses as much as digits as its factorization.
390491741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 38.
The square root of 390491741 is about 19760.8638728169. The cubic root of 390491741 is about 730.9212994072.
The spelling of 390491741 in words is "three hundred ninety million, four hundred ninety-one thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •