Base | Representation |
---|---|
bin | 10100110000100110111… |
… | …11100101111110110001 |
3 | 2112012010112000200000021 |
4 | 22120103133211332301 |
5 | 43141310123322043 |
6 | 1303403122523441 |
7 | 102351013510021 |
oct | 12302337457661 |
9 | 2465115020007 |
10 | 713291620273 |
11 | 255561584741 |
12 | b62a7b06581 |
13 | 523560944cb |
14 | 267486a1a81 |
15 | 1384ae103ed |
hex | a6137e5fb1 |
713291620273 has 4 divisors (see below), whose sum is σ = 717276489840. Its totient is φ = 709306750708.
The previous prime is 713291620267. The next prime is 713291620297. The reversal of 713291620273 is 372026192317.
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: 372026192317 = 13 ⋅28617399409.
It is a cyclic number.
It is not a de Polignac number, because 713291620273 - 25 = 713291620241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (713291620253) 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 3 ways as a sum of consecutive naturals, for example, 1992434515 + ... + 1992434872.
It is an arithmetic number, because the mean of its divisors is an integer number (179319122460).
Almost surely, 2713291620273 is an apocalyptic number.
It is an amenable number.
713291620273 is a deficient number, since it is larger than the sum of its proper divisors (3984869567).
713291620273 is a wasteful number, since it uses less digits than its factorization.
713291620273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3984869566.
The product of its (nonzero) digits is 190512, while the sum is 43.
The spelling of 713291620273 in words is "seven hundred thirteen billion, two hundred ninety-one million, six hundred twenty thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •