Base | Representation |
---|---|
bin | 11111110110110001001100… |
… | …001000001010100010000001 |
3 | 200101001201121122122210022101 |
4 | 133312301030020022202001 |
5 | 121330422132230413400 |
6 | 1213550251432510401 |
7 | 41340054453204343 |
oct | 3766611410124201 |
9 | 611051548583271 |
10 | 140103110404225 |
11 | 40706439385051 |
12 | 13868b0824b401 |
13 | 602388874b9c7 |
14 | 2685053493293 |
15 | 112e60b82756a |
hex | 7f6c4c20a881 |
140103110404225 has 24 divisors (see below), whose sum is σ = 174752949440888. Its totient is φ = 111421601049600.
The previous prime is 140103110404207. The next prime is 140103110404241. The reversal of 140103110404225 is 522404011301041.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 101645897277681 + 38457213126544 = 10081959^2 + 6201388^2 .
It is not a de Polignac number, because 140103110404225 - 233 = 140094520469633 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140103110404193 and 140103110404202.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6330457 + ... + 17896393.
Almost surely, 2140103110404225 is an apocalyptic number.
It is an amenable number.
140103110404225 is a deficient number, since it is larger than the sum of its proper divisors (34649839036663).
140103110404225 is a wasteful number, since it uses less digits than its factorization.
140103110404225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11568805 (or 11568800 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 28.
Adding to 140103110404225 its reverse (522404011301041), we get a palindrome (662507121705266).
The spelling of 140103110404225 in words is "one hundred forty trillion, one hundred three billion, one hundred ten million, four hundred four thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.205 sec. • engine limits •