Base | Representation |
---|---|
bin | 10100110000000111001… |
… | …11111001011011010101 |
3 | 2112011102222000022210201 |
4 | 22120003213321123111 |
5 | 43140233443032441 |
6 | 1303320452020501 |
7 | 102341301400516 |
oct | 12300347713325 |
9 | 2464388008721 |
10 | 713025361621 |
11 | 255435256671 |
12 | b6232901731 |
13 | 52312b7b601 |
14 | 26721192a0d |
15 | 13832868c31 |
hex | a6039f96d5 |
713025361621 has 4 divisors (see below), whose sum is σ = 713565943200. Its totient is φ = 712484780044.
The previous prime is 713025361591. The next prime is 713025361637. The reversal of 713025361621 is 126163520317.
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: 126163520317 = 197 ⋅640423961.
It is a cyclic number.
It is not a de Polignac number, because 713025361621 - 25 = 713025361589 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 (713025361021) 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, 270288811 + ... + 270291448.
It is an arithmetic number, because the mean of its divisors is an integer number (178391485800).
Almost surely, 2713025361621 is an apocalyptic number.
It is an amenable number.
713025361621 is a deficient number, since it is larger than the sum of its proper divisors (540581579).
713025361621 is a wasteful number, since it uses less digits than its factorization.
713025361621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 540581578.
The product of its (nonzero) digits is 45360, while the sum is 37.
Adding to 713025361621 its reverse (126163520317), we get a palindrome (839188881938).
The spelling of 713025361621 in words is "seven hundred thirteen billion, twenty-five million, three hundred sixty-one thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •