Base | Representation |
---|---|
bin | 11010010101110110… |
… | …00110100010010101 |
3 | 1100111120111102022122 |
4 | 31022323012202111 |
5 | 212430312043031 |
6 | 10255142105325 |
7 | 1010310146543 |
oct | 151273064225 |
9 | 40446442278 |
10 | 14141909141 |
11 | 5aa7814718 |
12 | 28a811b245 |
13 | 1444b37199 |
14 | 982296d93 |
15 | 57b81547b |
hex | 34aec6895 |
14141909141 has 4 divisors (see below), whose sum is σ = 14220914400. Its totient is φ = 14062903884.
The previous prime is 14141909129. The next prime is 14141909227. The reversal of 14141909141 is 14190914141.
14141909141 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, 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 14141909141 - 210 = 14141908117 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 (14141309141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39502361 + ... + 39502718.
It is an arithmetic number, because the mean of its divisors is an integer number (3555228600).
Almost surely, 214141909141 is an apocalyptic number.
It is an amenable number.
14141909141 is a deficient number, since it is larger than the sum of its proper divisors (79005259).
14141909141 is an equidigital number, since it uses as much as digits as its factorization.
14141909141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79005258.
The product of its (nonzero) digits is 5184, while the sum is 35.
The spelling of 14141909141 in words is "fourteen billion, one hundred forty-one million, nine hundred nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •