Base | Representation |
---|---|
bin | 110101110110100011100… |
… | …0000111000100101011111 |
3 | 222012120100200122010111111 |
4 | 1223231013000320211133 |
5 | 1432231102014040434 |
6 | 23424055422402451 |
7 | 1362510042343603 |
oct | 153550700704537 |
9 | 28176320563444 |
10 | 7401420065119 |
11 | 23a3a19743683 |
12 | 9b6540730427 |
13 | 418c4921c392 |
14 | 1b8332c51503 |
15 | cc7dbb02964 |
hex | 6bb4703895f |
7401420065119 has 2 divisors, whose sum is σ = 7401420065120. Its totient is φ = 7401420065118.
The previous prime is 7401420065047. The next prime is 7401420065159. The reversal of 7401420065119 is 9115600241047.
It is a happy number.
It is an a-pointer prime, because the next prime (7401420065159) can be obtained adding 7401420065119 to its sum of digits (40).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 7401420065119 - 27 = 7401420064991 is a prime.
It is a super-2 number, since 2×74014200651192 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7401420065159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3700710032559 + 3700710032560.
It is an arithmetic number, because the mean of its divisors is an integer number (3700710032560).
Almost surely, 27401420065119 is an apocalyptic number.
7401420065119 is a deficient number, since it is larger than the sum of its proper divisors (1).
7401420065119 is an equidigital number, since it uses as much as digits as its factorization.
7401420065119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 40.
The spelling of 7401420065119 in words is "seven trillion, four hundred one billion, four hundred twenty million, sixty-five thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •