Base | Representation |
---|---|
bin | 11001010000111001000111… |
… | …111000110011010010110101 |
3 | 112120102012112000120210002011 |
4 | 121100321013320303102311 |
5 | 104030424344031120041 |
6 | 1032152052553444221 |
7 | 32255402121652663 |
oct | 3120710770632265 |
9 | 476365460523064 |
10 | 111112010020021 |
11 | 3244937aa76a6a |
12 | 10566303410671 |
13 | 49cca8230bc4a |
14 | 1d61bc84b3c33 |
15 | cca429762e81 |
hex | 650e47e334b5 |
111112010020021 has 16 divisors (see below), whose sum is σ = 119643380700480. Its totient is φ = 102802386714880.
The previous prime is 111112010020013. The next prime is 111112010020103. The reversal of 111112010020021 is 120020010211111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 111112010020021 - 23 = 111112010020013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111112010019983 and 111112010020010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111112010090021) 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, 96908631 + ... + 98048491.
It is an arithmetic number, because the mean of its divisors is an integer number (7477711293780).
Almost surely, 2111112010020021 is an apocalyptic number.
It is an amenable number.
111112010020021 is a deficient number, since it is larger than the sum of its proper divisors (8531370680459).
111112010020021 is a wasteful number, since it uses less digits than its factorization.
111112010020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1237124.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 111112010020021 its reverse (120020010211111), we get a palindrome (231132020231132).
The spelling of 111112010020021 in words is "one hundred eleven trillion, one hundred twelve billion, ten million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •