Base | Representation |
---|---|
bin | 11001011101110100001000… |
… | …111011100100101010111101 |
3 | 112200120002121101222220202020 |
4 | 121131310020323210222331 |
5 | 104140002011033342341 |
6 | 1034112032322150353 |
7 | 32406506464234644 |
oct | 3135641073445275 |
9 | 480502541886666 |
10 | 112000012012221 |
11 | 32760a35a45a33 |
12 | 1068a4294b23b9 |
13 | 4a6572c180248 |
14 | 1d92b8823a35b |
15 | ce359d7b4566 |
hex | 65dd08ee4abd |
112000012012221 has 8 divisors (see below), whose sum is σ = 151132546330080. Its totient is φ = 73767076184592.
The previous prime is 112000012012169. The next prime is 112000012012243. The reversal of 112000012012221 is 122210210000211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112000012012221 - 29 = 112000012011709 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112000012012221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112000012012261) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 224899622266 + ... + 224899622763.
It is an arithmetic number, because the mean of its divisors is an integer number (18891568291260).
Almost surely, 2112000012012221 is an apocalyptic number.
It is an amenable number.
112000012012221 is a deficient number, since it is larger than the sum of its proper divisors (39132534317859).
112000012012221 is an equidigital number, since it uses as much as digits as its factorization.
112000012012221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 449799245115.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112000012012221 its reverse (122210210000211), we get a palindrome (234210222012432).
The spelling of 112000012012221 in words is "one hundred twelve trillion, twelve million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •