Base | Representation |
---|---|
bin | 10011001111000100110100… |
… | …00110111011101100000011 |
3 | 12112202210012112210120212111 |
4 | 21213202122012323230003 |
5 | 21021013204400031434 |
6 | 225544030432440151 |
7 | 11624014100561203 |
oct | 1147423206735403 |
9 | 175683175716774 |
10 | 42299423439619 |
11 | 125290a2873875 |
12 | 48b1ab33a9057 |
13 | 1a7aa8437aa38 |
14 | a634356a6403 |
15 | 4d548996a964 |
hex | 26789a1bbb03 |
42299423439619 has 2 divisors, whose sum is σ = 42299423439620. Its totient is φ = 42299423439618.
The previous prime is 42299423439607. The next prime is 42299423439677. The reversal of 42299423439619 is 91693432499224.
42299423439619 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42299423439619 is a prime.
It is a super-2 number, since 2×422994234396192 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (42299423439019) 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, 21149711719809 + 21149711719810.
It is an arithmetic number, because the mean of its divisors is an integer number (21149711719810).
Almost surely, 242299423439619 is an apocalyptic number.
42299423439619 is a deficient number, since it is larger than the sum of its proper divisors (1).
42299423439619 is an equidigital number, since it uses as much as digits as its factorization.
42299423439619 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 181398528, while the sum is 67.
The spelling of 42299423439619 in words is "forty-two trillion, two hundred ninety-nine billion, four hundred twenty-three million, four hundred thirty-nine thousand, six hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •