Base | Representation |
---|---|
bin | 10011000110111110010100… |
… | …00111011011000001000111 |
3 | 12111210011200122100111022001 |
4 | 21203133022013123001013 |
5 | 21001433110314000241 |
6 | 225212112344250131 |
7 | 11564630640434101 |
oct | 1143371207330107 |
9 | 174704618314261 |
10 | 42021056000071 |
11 | 12431036697405 |
12 | 4867b66770947 |
13 | 1a5a751220075 |
14 | a53b895b8571 |
15 | 4cd0e6509431 |
hex | 2637ca1db047 |
42021056000071 has 2 divisors, whose sum is σ = 42021056000072. Its totient is φ = 42021056000070.
The previous prime is 42021056000003. The next prime is 42021056000087. The reversal of 42021056000071 is 17000065012024.
42021056000071 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42021056000071 is a prime.
It is a super-2 number, since 2×420210560000712 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42021056004071) 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, 21010528000035 + 21010528000036.
It is an arithmetic number, because the mean of its divisors is an integer number (21010528000036).
Almost surely, 242021056000071 is an apocalyptic number.
42021056000071 is a deficient number, since it is larger than the sum of its proper divisors (1).
42021056000071 is an equidigital number, since it uses as much as digits as its factorization.
42021056000071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 28.
The spelling of 42021056000071 in words is "forty-two trillion, twenty-one billion, fifty-six million, seventy-one", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •