Base | Representation |
---|---|
bin | 11011000101010011… |
… | …10110111100010011 |
3 | 1101112022122122221012 |
4 | 31202221312330103 |
5 | 214234222321003 |
6 | 10402443321135 |
7 | 1023213214004 |
oct | 154251667423 |
9 | 41468578835 |
10 | 14540042003 |
11 | 6191524843 |
12 | 29995201ab |
13 | 14a9473966 |
14 | 9bd0d31ab |
15 | 5a175a8d8 |
hex | 362a76f13 |
14540042003 has 8 divisors (see below), whose sum is σ = 15010571136. Its totient is φ = 14069606400.
The previous prime is 14540041993. The next prime is 14540042009. The reversal of 14540042003 is 30024004541.
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 14540042003 - 24 = 14540041987 is a prime.
It is a super-2 number, since 2×145400420032 (a number of 21 digits) contains 22 as substring.
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 14540042003.
It is not an unprimeable number, because it can be changed into a prime (14540042009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 436313 + ... + 468453.
It is an arithmetic number, because the mean of its divisors is an integer number (1876321392).
Almost surely, 214540042003 is an apocalyptic number.
14540042003 is a deficient number, since it is larger than the sum of its proper divisors (470529133).
14540042003 is a wasteful number, since it uses less digits than its factorization.
14540042003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46765.
The product of its (nonzero) digits is 1920, while the sum is 23.
Adding to 14540042003 its reverse (30024004541), we get a palindrome (44564046544).
The spelling of 14540042003 in words is "fourteen billion, five hundred forty million, forty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •