Base | Representation |
---|---|
bin | 11001011111100100000101… |
… | …011010001011110010111101 |
3 | 112200222120212100111120200002 |
4 | 121133210011122023302331 |
5 | 104143434143233342341 |
6 | 1034243151521244045 |
7 | 32421263242334510 |
oct | 3137440532136275 |
9 | 480876770446602 |
10 | 112120212012221 |
11 | 327a7a07793006 |
12 | 106a9794193625 |
13 | 4a73b769218ba |
14 | 1d9890bd64d77 |
15 | ce67860c429b |
hex | 65f90568bcbd |
112120212012221 has 16 divisors (see below), whose sum is σ = 128227596994944. Its totient is φ = 96035384410944.
The previous prime is 112120212012197. The next prime is 112120212012229. The reversal of 112120212012221 is 122210212021211.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112120212012221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112120212012193 and 112120212012202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112120212012229) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 334546691 + ... + 334881663.
It is an arithmetic number, because the mean of its divisors is an integer number (8014224812184).
Almost surely, 2112120212012221 is an apocalyptic number.
It is an amenable number.
112120212012221 is a deficient number, since it is larger than the sum of its proper divisors (16107384982723).
112120212012221 is a wasteful number, since it uses less digits than its factorization.
112120212012221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 368500.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 112120212012221 its reverse (122210212021211), we get a palindrome (234330424033432).
The spelling of 112120212012221 in words is "one hundred twelve trillion, one hundred twenty billion, two hundred twelve million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •