Base | Representation |
---|---|
bin | 11111111011010010111011… |
… | …001110111111100001001101 |
3 | 200102011110121212101220221202 |
4 | 133323102323032333201031 |
5 | 121401021301300013123 |
6 | 1214345222030035245 |
7 | 41401410034112243 |
oct | 3773227316774115 |
9 | 612143555356852 |
10 | 140414212110413 |
11 | 4081637316653a |
12 | 138b926b648b25 |
13 | 6047007595217 |
14 | 2696126bbc793 |
15 | 1137768965a28 |
hex | 7fb4bb3bf84d |
140414212110413 has 16 divisors (see below), whose sum is σ = 147955305179136. Its totient is φ = 132993036261360.
The previous prime is 140414212110331. The next prime is 140414212110433. The reversal of 140414212110413 is 314011212414041.
It is a cyclic number.
It is not a de Polignac number, because 140414212110413 - 226 = 140414145001549 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 (140414212110433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23079656 + ... + 28521902.
It is an arithmetic number, because the mean of its divisors is an integer number (9247206573696).
Almost surely, 2140414212110413 is an apocalyptic number.
It is an amenable number.
140414212110413 is a deficient number, since it is larger than the sum of its proper divisors (7541093068723).
140414212110413 is a wasteful number, since it uses less digits than its factorization.
140414212110413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5453264.
The product of its (nonzero) digits is 3072, while the sum is 29.
Adding to 140414212110413 its reverse (314011212414041), we get a palindrome (454425424524454).
The spelling of 140414212110413 in words is "one hundred forty trillion, four hundred fourteen billion, two hundred twelve million, one hundred ten thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •