Base | Representation |
---|---|
bin | 1011100011010101110… |
… | …11010100001011110101 |
3 | 1101221112210120012222112 |
4 | 11301222323110023311 |
5 | 23000403304102201 |
6 | 502203023140405 |
7 | 40451214124241 |
oct | 5615273241365 |
9 | 1357483505875 |
10 | 396930925301 |
11 | 143379183129 |
12 | 64b17444705 |
13 | 2b579850501 |
14 | 152d6739421 |
15 | a4d225d0bb |
hex | 5c6aed42f5 |
396930925301 has 2 divisors, whose sum is σ = 396930925302. Its totient is φ = 396930925300.
The previous prime is 396930925283. The next prime is 396930925309. The reversal of 396930925301 is 103529039693.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 386971084900 + 9959840401 = 622070^2 + 99799^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-396930925301 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 396930925301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (396930925309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 198465462650 + 198465462651.
It is an arithmetic number, because the mean of its divisors is an integer number (198465462651).
Almost surely, 2396930925301 is an apocalyptic number.
It is an amenable number.
396930925301 is a deficient number, since it is larger than the sum of its proper divisors (1).
396930925301 is an equidigital number, since it uses as much as digits as its factorization.
396930925301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1180980, while the sum is 50.
It can be divided in two parts, 396930 and 925301, that added together give a palindrome (1322231).
The spelling of 396930925301 in words is "three hundred ninety-six billion, nine hundred thirty million, nine hundred twenty-five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •