Base | Representation |
---|---|
bin | 10100110001100110111… |
… | …10100111101101111101 |
3 | 2112020111220202120121122 |
4 | 22120303132213231331 |
5 | 43143410012024112 |
6 | 1303532252240325 |
7 | 102400220615561 |
oct | 12306336475575 |
9 | 2466456676548 |
10 | 713828236157 |
11 | 255807480143 |
12 | b64177700a5 |
13 | 524102c99ba |
14 | 26799a696a1 |
15 | 1387d0ac872 |
hex | a6337a7b7d |
713828236157 has 4 divisors (see below), whose sum is σ = 721187290236. Its totient is φ = 706469182080.
The previous prime is 713828236133. The next prime is 713828236223. The reversal of 713828236157 is 751632828317.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 497992730596 + 215835505561 = 705686^2 + 464581^2 .
It is a cyclic number.
It is not a de Polignac number, because 713828236157 - 214 = 713828219773 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 713828236099 and 713828236108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (713828236057) 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, 3679526894 + ... + 3679527087.
It is an arithmetic number, because the mean of its divisors is an integer number (180296822559).
Almost surely, 2713828236157 is an apocalyptic number.
It is an amenable number.
713828236157 is a deficient number, since it is larger than the sum of its proper divisors (7359054079).
713828236157 is an equidigital number, since it uses as much as digits as its factorization.
713828236157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7359054078.
The product of its digits is 3386880, while the sum is 53.
The spelling of 713828236157 in words is "seven hundred thirteen billion, eight hundred twenty-eight million, two hundred thirty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •