Base | Representation |
---|---|
bin | 101110010101001011101110… |
… | …0100011100100101100101111 |
3 | 1222102221122110221020221211212 |
4 | 1130222113130203210230233 |
5 | 411403444331040200324 |
6 | 4002425244324505035 |
7 | 151561122514162604 |
oct | 13452273443445457 |
9 | 1872848427227755 |
10 | 407531672193839 |
11 | 108941236696446 |
12 | 3985a45054b17b |
13 | 146520c194b23b |
14 | 728c8d12366ab |
15 | 321ac79c9970e |
hex | 172a5dc8e4b2f |
407531672193839 has 2 divisors, whose sum is σ = 407531672193840. Its totient is φ = 407531672193838.
The previous prime is 407531672193643. The next prime is 407531672193851. The reversal of 407531672193839 is 938391276135704.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 407531672193839 - 216 = 407531672128303 is a prime.
It is a super-2 number, since 2×4075316721938392 (a number of 30 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (407531672193439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 203765836096919 + 203765836096920.
It is an arithmetic number, because the mean of its divisors is an integer number (203765836096920).
It is a 1-persistent number, because it is pandigital, but 2⋅407531672193839 = 815063344387678 is not.
Almost surely, 2407531672193839 is an apocalyptic number.
407531672193839 is a deficient number, since it is larger than the sum of its proper divisors (1).
407531672193839 is an equidigital number, since it uses as much as digits as its factorization.
407531672193839 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 205752960, while the sum is 68.
The spelling of 407531672193839 in words is "four hundred seven trillion, five hundred thirty-one billion, six hundred seventy-two million, one hundred ninety-three thousand, eight hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •