Base | Representation |
---|---|
bin | 11001011110000110111100… |
… | …010010111010100011011101 |
3 | 112200122000201102100221212100 |
4 | 121132012330102322203131 |
5 | 104140314332441401023 |
6 | 1034125211524555313 |
7 | 32411123003651232 |
oct | 3136067422724335 |
9 | 480560642327770 |
10 | 112020201122013 |
11 | 32769556199a38 |
12 | 10692322852b39 |
13 | 4a675c8a9b362 |
14 | 1d93b416ab789 |
15 | ce3d80e37c43 |
hex | 65e1bc4ba8dd |
112020201122013 has 24 divisors (see below), whose sum is σ = 162219697174080. Its totient is φ = 74489697089280.
The previous prime is 112020201122009. The next prime is 112020201122033. The reversal of 112020201122013 is 310221102020211.
It is not a de Polignac number, because 112020201122013 - 22 = 112020201122009 is a prime.
It is a super-2 number, since 2×1120202011220132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112020201122033) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20622408 + ... + 25481838.
It is an arithmetic number, because the mean of its divisors is an integer number (6759154048920).
Almost surely, 2112020201122013 is an apocalyptic number.
It is an amenable number.
112020201122013 is a deficient number, since it is larger than the sum of its proper divisors (50199496052067).
112020201122013 is a wasteful number, since it uses less digits than its factorization.
112020201122013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4865969 (or 4865966 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 112020201122013 its reverse (310221102020211), we get a palindrome (422241303142224).
The spelling of 112020201122013 in words is "one hundred twelve trillion, twenty billion, two hundred one million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •