Base | Representation |
---|---|
bin | 11010001000111010… |
… | …01011110100000111 |
3 | 1100020000022202001222 |
4 | 31010131023310013 |
5 | 212220022400033 |
6 | 10240304310555 |
7 | 1004521646534 |
oct | 150435136407 |
9 | 40200282058 |
10 | 14033403143 |
11 | 5a51543541 |
12 | 287791245b |
13 | 1428505b56 |
14 | 971acdd8b |
15 | 572030598 |
hex | 34474bd07 |
14033403143 has 8 divisors (see below), whose sum is σ = 14197508640. Its totient is φ = 13869440640.
The previous prime is 14033403121. The next prime is 14033403191. The reversal of 14033403143 is 34130433041.
It is a happy number.
14033403143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14033403143 - 212 = 14033399047 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 (14033405143) 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 7 ways as a sum of consecutive naturals, for example, 168446 + ... + 237572.
It is an arithmetic number, because the mean of its divisors is an integer number (1774688580).
Almost surely, 214033403143 is an apocalyptic number.
14033403143 is a deficient number, since it is larger than the sum of its proper divisors (164105497).
14033403143 is an equidigital number, since it uses as much as digits as its factorization.
14033403143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71497.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 14033403143 its reverse (34130433041), we get a palindrome (48163836184).
The spelling of 14033403143 in words is "fourteen billion, thirty-three million, four hundred three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •