Base | Representation |
---|---|
bin | 11010001001110101… |
… | …00011101010011001 |
3 | 1100020112210221021220 |
4 | 31010322203222121 |
5 | 212224010244001 |
6 | 10241141322253 |
7 | 1004644256232 |
oct | 150472435231 |
9 | 40215727256 |
10 | 14041103001 |
11 | 5a55922562 |
12 | 287a406389 |
13 | 1429ca0793 |
14 | 972b36089 |
15 | 572a51c36 |
hex | 344ea3a99 |
14041103001 has 4 divisors (see below), whose sum is σ = 18721470672. Its totient is φ = 9360735332.
The previous prime is 14041102981. The next prime is 14041103003. The reversal of 14041103001 is 10030114041.
14041103001 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 14041103001 - 25 = 14041102969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (14041103003) 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, 2340183831 + ... + 2340183836.
It is an arithmetic number, because the mean of its divisors is an integer number (4680367668).
Almost surely, 214041103001 is an apocalyptic number.
It is an amenable number.
14041103001 is a deficient number, since it is larger than the sum of its proper divisors (4680367671).
14041103001 is an equidigital number, since it uses as much as digits as its factorization.
14041103001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4680367670.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 14041103001 its reverse (10030114041), we get a palindrome (24071217042).
The spelling of 14041103001 in words is "fourteen billion, forty-one million, one hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •