Base | Representation |
---|---|
bin | 11010010000111010… |
… | …00001010001000101 |
3 | 1100101200112000212101 |
4 | 31020131001101011 |
5 | 212334210000210 |
6 | 10251101552101 |
7 | 1006265002333 |
oct | 151035012105 |
9 | 40350460771 |
10 | 14100468805 |
11 | 5a8638aa05 |
12 | 2896275631 |
13 | 1439387b87 |
14 | 97a98ab53 |
15 | 577d7ba3a |
hex | 348741445 |
14100468805 has 4 divisors (see below), whose sum is σ = 16920562572. Its totient is φ = 11280375040.
The previous prime is 14100468799. The next prime is 14100468821. The reversal of 14100468805 is 50886400141.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50886400141 = 61 ⋅834203281.
It can be written as a sum of positive squares in 2 ways, for example, as 4227860484 + 9872608321 = 65022^2 + 99361^2 .
It is not a de Polignac number, because 14100468805 - 27 = 14100468677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1410046876 + ... + 1410046885.
It is an arithmetic number, because the mean of its divisors is an integer number (4230140643).
Almost surely, 214100468805 is an apocalyptic number.
It is an amenable number.
14100468805 is a deficient number, since it is larger than the sum of its proper divisors (2820093767).
14100468805 is an equidigital number, since it uses as much as digits as its factorization.
14100468805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2820093766.
The product of its (nonzero) digits is 30720, while the sum is 37.
Adding to 14100468805 its reverse (50886400141), we get a palindrome (64986868946).
The spelling of 14100468805 in words is "fourteen billion, one hundred million, four hundred sixty-eight thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •