Base | Representation |
---|---|
bin | 11111110110010110100010… |
… | …111111101000111001000001 |
3 | 200100221222202221210220011012 |
4 | 133312112202333220321001 |
5 | 121324440040233003001 |
6 | 1213525201025130305 |
7 | 41335022523340211 |
oct | 3766264277507101 |
9 | 610858687726135 |
10 | 140074503016001 |
11 | 406a5299243944 |
12 | 13863463789995 |
13 | 6020c79a49558 |
14 | 26838dbd96241 |
15 | 112d9d50d42bb |
hex | 7f65a2fe8e41 |
140074503016001 has 4 divisors (see below), whose sum is σ = 140081064826032. Its totient is φ = 140067941205972.
The previous prime is 140074503015971. The next prime is 140074503016027. The reversal of 140074503016001 is 100610305470041.
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 140074503016001 - 234 = 140057323146817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140074500016001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3280872995 + ... + 3280915688.
It is an arithmetic number, because the mean of its divisors is an integer number (35020266206508).
Almost surely, 2140074503016001 is an apocalyptic number.
It is an amenable number.
140074503016001 is a deficient number, since it is larger than the sum of its proper divisors (6561810031).
140074503016001 is an equidigital number, since it uses as much as digits as its factorization.
140074503016001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6561810030.
The product of its (nonzero) digits is 10080, while the sum is 32.
Adding to 140074503016001 its reverse (100610305470041), we get a palindrome (240684808486042).
The spelling of 140074503016001 in words is "one hundred forty trillion, seventy-four billion, five hundred three million, sixteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •