Base | Representation |
---|---|
bin | 11111111011010011101101… |
… | …010000110000100011100101 |
3 | 200102011112210100201222202102 |
4 | 133323103231100300203211 |
5 | 121401030011131343323 |
6 | 1214345441211421445 |
7 | 41401436605206353 |
oct | 3773235520604345 |
9 | 612145710658672 |
10 | 140415051434213 |
11 | 40816763a15976 |
12 | 138b9464754885 |
13 | 604710c435c1a |
14 | 26961a64627d3 |
15 | 11377b74a9328 |
hex | 7fb4ed4308e5 |
140415051434213 has 4 divisors (see below), whose sum is σ = 140415256922028. Its totient is φ = 140414845946400.
The previous prime is 140415051434191. The next prime is 140415051434291. The reversal of 140415051434213 is 312434150514041.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 103307241576289 + 37107809857924 = 10164017^2 + 6091618^2 .
It is a cyclic number.
It is not a de Polignac number, because 140415051434213 - 26 = 140415051434149 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 (140415051434813) 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, 101715488 + ... + 103086713.
It is an arithmetic number, because the mean of its divisors is an integer number (35103814230507).
Almost surely, 2140415051434213 is an apocalyptic number.
It is an amenable number.
140415051434213 is a deficient number, since it is larger than the sum of its proper divisors (205487815).
140415051434213 is an equidigital number, since it uses as much as digits as its factorization.
140415051434213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 205487814.
The product of its (nonzero) digits is 115200, while the sum is 38.
The spelling of 140415051434213 in words is "one hundred forty trillion, four hundred fifteen billion, fifty-one million, four hundred thirty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •