Base | Representation |
---|---|
bin | 11001011110000110111110… |
… | …000001111010100100010001 |
3 | 112200122000210110010021212101 |
4 | 121132012332001322210101 |
5 | 104140314412414020144 |
6 | 1034125214444400401 |
7 | 32411123506202164 |
oct | 3136067601724421 |
9 | 480560713107771 |
10 | 112020230220049 |
11 | 327695706637a8 |
12 | 10692330546101 |
13 | 4a67601b18928 |
14 | 1d93b454c3adb |
15 | ce3d837846d4 |
hex | 65e1be07a911 |
112020230220049 has 2 divisors, whose sum is σ = 112020230220050. Its totient is φ = 112020230220048.
The previous prime is 112020230220023. The next prime is 112020230220079. The reversal of 112020230220049 is 940022032020211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102067719562449 + 9952510657600 = 10102857^2 + 3154760^2 .
It is a cyclic number.
It is not a de Polignac number, because 112020230220049 - 29 = 112020230219537 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112020230219999 and 112020230220026.
It is not a weakly prime, because it can be changed into another prime (112020230220079) 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, 56010115110024 + 56010115110025.
It is an arithmetic number, because the mean of its divisors is an integer number (56010115110025).
Almost surely, 2112020230220049 is an apocalyptic number.
It is an amenable number.
112020230220049 is a deficient number, since it is larger than the sum of its proper divisors (1).
112020230220049 is an equidigital number, since it uses as much as digits as its factorization.
112020230220049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 28.
The spelling of 112020230220049 in words is "one hundred twelve trillion, twenty billion, two hundred thirty million, two hundred twenty thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •