Base | Representation |
---|---|
bin | 10100011111100100000… |
… | …00110111100111111001 |
3 | 2111022111201121100020201 |
4 | 22033302000313213321 |
5 | 43014034313431403 |
6 | 1255251043322201 |
7 | 101605150050562 |
oct | 12176200674771 |
9 | 2438451540221 |
10 | 704139983353 |
11 | 251695733444 |
12 | b4573080361 |
13 | 51528091231 |
14 | 2611b097169 |
15 | 134b277e21d |
hex | a3f20379f9 |
704139983353 has 4 divisors (see below), whose sum is σ = 704144942928. Its totient is φ = 704135023780.
The previous prime is 704139983333. The next prime is 704139983369. The reversal of 704139983353 is 353389931407.
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, and also an emirpimes, since its reverse is a distinct semiprime: 353389931407 = 163 ⋅2168036389.
It is a cyclic number.
It is not a de Polignac number, because 704139983353 - 221 = 704137886201 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 704139983294 and 704139983303.
It is not an unprimeable number, because it can be changed into a prime (704139983333) 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, 2260351 + ... + 2552932.
It is an arithmetic number, because the mean of its divisors is an integer number (176036235732).
Almost surely, 2704139983353 is an apocalyptic number.
It is an amenable number.
704139983353 is a deficient number, since it is larger than the sum of its proper divisors (4959575).
704139983353 is a wasteful number, since it uses less digits than its factorization.
704139983353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4959574.
The product of its (nonzero) digits is 7348320, while the sum is 55.
The spelling of 704139983353 in words is "seven hundred four billion, one hundred thirty-nine million, nine hundred eighty-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •