Base | Representation |
---|---|
bin | 1100011101010111011… |
… | …0000011001000001101 |
3 | 202110110220010010122101 |
4 | 3013111312003020031 |
5 | 12001324011104401 |
6 | 242155031515101 |
7 | 21315065304544 |
oct | 3072566031015 |
9 | 673426103571 |
10 | 214041113101 |
11 | 828576a0302 |
12 | 35595b28a91 |
13 | 172512c441a |
14 | a506c1b15b |
15 | 587aec9101 |
hex | 31d5d8320d |
214041113101 has 4 divisors (see below), whose sum is σ = 214380323104. Its totient is φ = 213701903100.
The previous prime is 214041113081. The next prime is 214041113107. The reversal of 214041113101 is 101311140412.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 214041113101 - 225 = 214007558669 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (214041113107) 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, 169604055 + ... + 169605316.
It is an arithmetic number, because the mean of its divisors is an integer number (53595080776).
Almost surely, 2214041113101 is an apocalyptic number.
It is an amenable number.
214041113101 is a deficient number, since it is larger than the sum of its proper divisors (339210003).
214041113101 is an equidigital number, since it uses as much as digits as its factorization.
214041113101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 339210002.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 214041113101 its reverse (101311140412), we get a palindrome (315352253513).
It can be divided in two parts, 2140411 and 13101, that added together give a palindrome (2153512).
The spelling of 214041113101 in words is "two hundred fourteen billion, forty-one million, one hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •