Base | Representation |
---|---|
bin | 10100011111011001101… |
… | …11000111010100101101 |
3 | 2111022021200221120110021 |
4 | 22033230313013110231 |
5 | 43013400201241031 |
6 | 1255234314442141 |
7 | 101603050230550 |
oct | 12175467072455 |
9 | 2438250846407 |
10 | 704053540141 |
11 | 251650961376 |
12 | b454a133351 |
13 | 515131b61c3 |
14 | 2610d7d4697 |
15 | 134a9da6511 |
hex | a3ecdc752d |
704053540141 has 8 divisors (see below), whose sum is σ = 804637774400. Its totient is φ = 603470595168.
The previous prime is 704053540133. The next prime is 704053540147. The reversal of 704053540141 is 141045350407.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 704053540141 - 23 = 704053540133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 704053540097 and 704053540106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (704053540147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1663585 + ... + 2043433.
It is an arithmetic number, because the mean of its divisors is an integer number (100579721800).
Almost surely, 2704053540141 is an apocalyptic number.
It is an amenable number.
704053540141 is a deficient number, since it is larger than the sum of its proper divisors (100584234259).
704053540141 is a wasteful number, since it uses less digits than its factorization.
704053540141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 644643.
The product of its (nonzero) digits is 33600, while the sum is 34.
Adding to 704053540141 its reverse (141045350407), we get a palindrome (845098890548).
The spelling of 704053540141 in words is "seven hundred four billion, fifty-three million, five hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •