Base | Representation |
---|---|
bin | 11111111100111010100001… |
… | …010000110100001100101101 |
3 | 200102120002201220201010111001 |
4 | 133330322201100310030231 |
5 | 121404332103023433123 |
6 | 1214512255400200301 |
7 | 41412425353432336 |
oct | 3774724120641455 |
9 | 612502656633431 |
10 | 140525445530413 |
11 | 40859563569319 |
12 | 13916933469091 |
13 | 6054653488138 |
14 | 269b679b1128d |
15 | 113a5c8e9b0ad |
hex | 7fcea143432d |
140525445530413 has 4 divisors (see below), whose sum is σ = 140525924604480. Its totient is φ = 140524966456348.
The previous prime is 140525445530401. The next prime is 140525445530417. The reversal of 140525445530413 is 314035544525041.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 140525445530413 - 221 = 140525443433261 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 (140525445530417) 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, 239096773 + ... + 239683786.
It is an arithmetic number, because the mean of its divisors is an integer number (35131481151120).
Almost surely, 2140525445530413 is an apocalyptic number.
It is an amenable number.
140525445530413 is a deficient number, since it is larger than the sum of its proper divisors (479074067).
140525445530413 is an equidigital number, since it uses as much as digits as its factorization.
140525445530413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479074066.
The product of its (nonzero) digits is 2880000, while the sum is 46.
The spelling of 140525445530413 in words is "one hundred forty trillion, five hundred twenty-five billion, four hundred forty-five million, five hundred thirty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •