Base | Representation |
---|---|
bin | 10011001111110001110000… |
… | …10111001000011001010011 |
3 | 12112212002111012102122111101 |
4 | 21213320320113020121103 |
5 | 21021412114122310304 |
6 | 230003101051525231 |
7 | 11625530051314204 |
oct | 1147707027103123 |
9 | 175762435378441 |
10 | 42323553322579 |
11 | 12538355529001 |
12 | 48b6708459817 |
13 | 1a8012b5514a9 |
14 | a646842715ab |
15 | 4d5ded0658a4 |
hex | 267e385c8653 |
42323553322579 has 2 divisors, whose sum is σ = 42323553322580. Its totient is φ = 42323553322578.
The previous prime is 42323553322493. The next prime is 42323553322607. The reversal of 42323553322579 is 97522335532324.
42323553322579 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 not a de Polignac number, because 42323553322579 - 221 = 42323551225427 is a prime.
It is a super-2 number, since 2×423235533225792 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (42323554322579) 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, 21161776661289 + 21161776661290.
It is an arithmetic number, because the mean of its divisors is an integer number (21161776661290).
Almost surely, 242323553322579 is an apocalyptic number.
42323553322579 is a deficient number, since it is larger than the sum of its proper divisors (1).
42323553322579 is an equidigital number, since it uses as much as digits as its factorization.
42323553322579 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 40824000, while the sum is 55.
The spelling of 42323553322579 in words is "forty-two trillion, three hundred twenty-three billion, five hundred fifty-three million, three hundred twenty-two thousand, five hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •