Base | Representation |
---|---|
bin | 1100011101010001100… |
… | …1010011010110001011 |
3 | 202110102012100220112022 |
4 | 3013110121103112023 |
5 | 12001301300101024 |
6 | 242152402435055 |
7 | 21314351533352 |
oct | 3072431232613 |
9 | 673365326468 |
10 | 214016800139 |
11 | 828449a464a |
12 | 35589962a8b |
13 | 17249260b5c |
14 | a5038cc999 |
15 | 5878cc535e |
hex | 31d465358b |
214016800139 has 4 divisors (see below), whose sum is σ = 214019445024. Its totient is φ = 214014155256.
The previous prime is 214016800103. The next prime is 214016800181. The reversal of 214016800139 is 931008610412.
214016800139 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 214016800139 - 224 = 214000022923 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 214016800099 and 214016800108.
It is not an unprimeable number, because it can be changed into a prime (214016800199) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1197107 + ... + 1364220.
It is an arithmetic number, because the mean of its divisors is an integer number (53504861256).
Almost surely, 2214016800139 is an apocalyptic number.
214016800139 is a deficient number, since it is larger than the sum of its proper divisors (2644885).
214016800139 is an equidigital number, since it uses as much as digits as its factorization.
214016800139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2644884.
The product of its (nonzero) digits is 10368, while the sum is 35.
The spelling of 214016800139 in words is "two hundred fourteen billion, sixteen million, eight hundred thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •