Base | Representation |
---|---|
bin | 11111111011001001100111… |
… | …001101100011000110100101 |
3 | 200102010111210222101122112011 |
4 | 133323021213031203012211 |
5 | 121400340311400324031 |
6 | 1214340445455554221 |
7 | 41400604162656505 |
oct | 3773114715430645 |
9 | 612114728348464 |
10 | 140404212511141 |
11 | 408121016a5607 |
12 | 138b733a82b971 |
13 | 60460a29b8287 |
14 | 2695858b21a05 |
15 | 1137380b366b1 |
hex | 7fb2673631a5 |
140404212511141 has 8 divisors (see below), whose sum is σ = 141216652708704. Its totient is φ = 139591782143280.
The previous prime is 140404212511127. The next prime is 140404212511159. The reversal of 140404212511141 is 141115212404041.
It is a happy number.
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 140404212511141 - 219 = 140404211986853 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140404212514141) 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, 27226950 + ... + 31970536.
It is an arithmetic number, because the mean of its divisors is an integer number (17652081588588).
Almost surely, 2140404212511141 is an apocalyptic number.
It is an amenable number.
140404212511141 is a deficient number, since it is larger than the sum of its proper divisors (812440197563).
140404212511141 is a wasteful number, since it uses less digits than its factorization.
140404212511141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4914851.
The product of its (nonzero) digits is 5120, while the sum is 31.
Adding to 140404212511141 its reverse (141115212404041), we get a palindrome (281519424915182).
The spelling of 140404212511141 in words is "one hundred forty trillion, four hundred four billion, two hundred twelve million, five hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •