Base | Representation |
---|---|
bin | 1000001001100011110… |
… | …0110110110101100001 |
3 | 111101101012012010012110 |
4 | 2002120330312311201 |
5 | 4243212242343203 |
6 | 144152321545533 |
7 | 13054312143354 |
oct | 2023074666541 |
9 | 441335163173 |
10 | 140005043553 |
11 | 54415219471 |
12 | 231734a52a9 |
13 | 1028293984b |
14 | 6ac218229b |
15 | 39963bad03 |
hex | 2098f36d61 |
140005043553 has 8 divisors (see below), whose sum is σ = 188770845600. Its totient is φ = 92287968608.
The previous prime is 140005043513. The next prime is 140005043593. The reversal of 140005043553 is 355340500041.
It is an interprime number because it is at equal distance from previous prime (140005043513) and next prime (140005043593).
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 140005043553 - 212 = 140005039457 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140005043553.
It is not an unprimeable number, because it can be changed into a prime (140005043513) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 262181463 + ... + 262181996.
It is an arithmetic number, because the mean of its divisors is an integer number (23596355700).
Almost surely, 2140005043553 is an apocalyptic number.
It is an amenable number.
140005043553 is a deficient number, since it is larger than the sum of its proper divisors (48765802047).
140005043553 is an equidigital number, since it uses as much as digits as its factorization.
140005043553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 524363551.
The product of its (nonzero) digits is 18000, while the sum is 30.
Adding to 140005043553 its reverse (355340500041), we get a palindrome (495345543594).
The spelling of 140005043553 in words is "one hundred forty billion, five million, forty-three thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •