Base | Representation |
---|---|
bin | 100111010011100011… |
… | …101100101000110001 |
3 | 11000221021101012002101 |
4 | 213103203230220301 |
5 | 1142413214243423 |
6 | 31215511220401 |
7 | 3022566362242 |
oct | 472343545061 |
9 | 130837335071 |
10 | 42204056113 |
11 | 169980a901a |
12 | 821a077701 |
13 | 3c978a418b |
14 | 20851c2cc9 |
15 | 11702557ad |
hex | 9d38eca31 |
42204056113 has 2 divisors, whose sum is σ = 42204056114. Its totient is φ = 42204056112.
The previous prime is 42204056107. The next prime is 42204056131. The reversal of 42204056113 is 31165040224.
42204056113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (42204056131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 31294671409 + 10909384704 = 176903^2 + 104448^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42204056113 is a prime.
It is not a weakly prime, because it can be changed into another prime (42204056173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21102028056 + 21102028057.
It is an arithmetic number, because the mean of its divisors is an integer number (21102028057).
Almost surely, 242204056113 is an apocalyptic number.
It is an amenable number.
42204056113 is a deficient number, since it is larger than the sum of its proper divisors (1).
42204056113 is an equidigital number, since it uses as much as digits as its factorization.
42204056113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 42204056113 its reverse (31165040224), we get a palindrome (73369096337).
The spelling of 42204056113 in words is "forty-two billion, two hundred four million, fifty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •