Base | Representation |
---|---|
bin | 11111111011101100111010… |
… | …001100101000111110100011 |
3 | 200102021010122020222100220222 |
4 | 133323230322030220332203 |
5 | 121402000421133112003 |
6 | 1214410114321353255 |
7 | 41403415313232005 |
oct | 3773547214507643 |
9 | 612233566870828 |
10 | 140442112004003 |
11 | 4082718a9a9537 |
12 | 1390275719882b |
13 | 6049832832bb4 |
14 | 2697612350375 |
15 | 113834d005c38 |
hex | 7fbb3a328fa3 |
140442112004003 has 8 divisors (see below), whose sum is σ = 140488102392000. Its totient is φ = 140396123694888.
The previous prime is 140442112003981. The next prime is 140442112004111. The reversal of 140442112004003 is 300400211244041.
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 140442112004003 - 28 = 140442112003747 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140442112004303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 140895200 + ... + 141888482.
It is an arithmetic number, because the mean of its divisors is an integer number (17561012799000).
Almost surely, 2140442112004003 is an apocalyptic number.
140442112004003 is a deficient number, since it is larger than the sum of its proper divisors (45990387997).
140442112004003 is an equidigital number, since it uses as much as digits as its factorization.
140442112004003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1039441.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 140442112004003 its reverse (300400211244041), we get a palindrome (440842323248044).
The spelling of 140442112004003 in words is "one hundred forty trillion, four hundred forty-two billion, one hundred twelve million, four thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •