Base | Representation |
---|---|
bin | 11010010010000011… |
… | …00100111000000001 |
3 | 1100102100112220022122 |
4 | 31021001210320001 |
5 | 212344133124331 |
6 | 10252043214025 |
7 | 1006442314244 |
oct | 151101447001 |
9 | 40370486278 |
10 | 14110051841 |
11 | 5a90835876 |
12 | 2899517315 |
13 | 143b361a02 |
14 | 97bd6325b |
15 | 578b2117b |
hex | 349064e01 |
14110051841 has 4 divisors (see below), whose sum is σ = 14112846000. Its totient is φ = 14107257684.
The previous prime is 14110051831. The next prime is 14110051873. The reversal of 14110051841 is 14815001141.
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, and also an emirpimes, since its reverse is a distinct semiprime: 14815001141 = 191 ⋅77565451.
It is a cyclic number.
It is not a de Polignac number, because 14110051841 - 210 = 14110050817 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14110051841.
It is not an unprimeable number, because it can be changed into a prime (14110051811) 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, 1389491 + ... + 1399608.
It is an arithmetic number, because the mean of its divisors is an integer number (3528211500).
Almost surely, 214110051841 is an apocalyptic number.
It is an amenable number.
14110051841 is a deficient number, since it is larger than the sum of its proper divisors (2794159).
14110051841 is an equidigital number, since it uses as much as digits as its factorization.
14110051841 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2794158.
The product of its (nonzero) digits is 640, while the sum is 26.
Adding to 14110051841 its reverse (14815001141), we get a palindrome (28925052982).
The spelling of 14110051841 in words is "fourteen billion, one hundred ten million, fifty-one thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •