Base | Representation |
---|---|
bin | 11111111000110000101011… |
… | …100100110111010110110001 |
3 | 200101112210221221200000201021 |
4 | 133320300223210313112301 |
5 | 121340143011311430301 |
6 | 1214133211301135441 |
7 | 41353002005101114 |
oct | 3770605344672661 |
9 | 611483857600637 |
10 | 140240003233201 |
11 | 407594a6859653 |
12 | 1388b5513ba581 |
13 | 6033763674961 |
14 | 268b91c17c57b |
15 | 1132e6e8858a1 |
hex | 7f8c2b9375b1 |
140240003233201 has 16 divisors (see below), whose sum is σ = 140829350850000. Its totient is φ = 139651868049408.
The previous prime is 140240003233171. The next prime is 140240003233241. The reversal of 140240003233201 is 102332300042041.
It can be written as a sum of positive squares in 8 ways, for example, as 164611964176 + 140075391269025 = 405724^2 + 11835345^2 .
It is a cyclic number.
It is not a de Polignac number, because 140240003233201 - 213 = 140240003225009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140240003233241) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 788675835 + ... + 788853631.
It is an arithmetic number, because the mean of its divisors is an integer number (8801834428125).
Almost surely, 2140240003233201 is an apocalyptic number.
It is an amenable number.
140240003233201 is a deficient number, since it is larger than the sum of its proper divisors (589347616799).
140240003233201 is a wasteful number, since it uses less digits than its factorization.
140240003233201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181188.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 140240003233201 its reverse (102332300042041), we get a palindrome (242572303275242).
The spelling of 140240003233201 in words is "one hundred forty trillion, two hundred forty billion, three million, two hundred thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •