Base | Representation |
---|---|
bin | 1110101010010111110101… |
… | …1101000000111111001111 |
3 | 2010002011102100210220202021 |
4 | 3222211331131000333033 |
5 | 4103112021424120421 |
6 | 54141534450111011 |
7 | 3252466210502335 |
oct | 352457535007717 |
9 | 63064370726667 |
10 | 16121117020111 |
11 | 5155a22310304 |
12 | 198446957b467 |
13 | 8cc2a3c3230c |
14 | 3da3a2753b55 |
15 | 1ce531e7a341 |
hex | ea97d740fcf |
16121117020111 has 4 divisors (see below), whose sum is σ = 17069418021312. Its totient is φ = 15172816018912.
The previous prime is 16121117020103. The next prime is 16121117020121. The reversal of 16121117020111 is 11102071112161.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 16121117020111 - 23 = 16121117020103 is a prime.
It is a super-2 number, since 2×161211170201112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16121117020121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 474150500575 + ... + 474150500608.
It is an arithmetic number, because the mean of its divisors is an integer number (4267354505328).
Almost surely, 216121117020111 is an apocalyptic number.
16121117020111 is a deficient number, since it is larger than the sum of its proper divisors (948301001201).
16121117020111 is an equidigital number, since it uses as much as digits as its factorization.
16121117020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 948301001200.
The product of its (nonzero) digits is 168, while the sum is 25.
Adding to 16121117020111 its reverse (11102071112161), we get a palindrome (27223188132272).
The spelling of 16121117020111 in words is "sixteen trillion, one hundred twenty-one billion, one hundred seventeen million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •