Base | Representation |
---|---|
bin | 1011001000000010… |
… | …01010011011101101 |
3 | 120102021020112002121 |
4 | 11210001022123231 |
5 | 44213041300043 |
6 | 2424405552541 |
7 | 301005416005 |
oct | 54401123355 |
9 | 16367215077 |
10 | 5972993773 |
11 | 259566569a |
12 | 11a8415751 |
13 | 742601656 |
14 | 4093bd005 |
15 | 24e5a0ded |
hex | 16404a6ed |
5972993773 has 2 divisors, whose sum is σ = 5972993774. Its totient is φ = 5972993772.
The previous prime is 5972993759. The next prime is 5972993821. The reversal of 5972993773 is 3773992795.
5972993773 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5652333124 + 320660649 = 75182^2 + 17907^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5972993773 is a prime.
It is a super-2 number, since 2×59729937732 = 71353309224593551058, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5972993723) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2986496886 + 2986496887.
It is an arithmetic number, because the mean of its divisors is an integer number (2986496887).
Almost surely, 25972993773 is an apocalyptic number.
It is an amenable number.
5972993773 is a deficient number, since it is larger than the sum of its proper divisors (1).
5972993773 is an equidigital number, since it uses as much as digits as its factorization.
5972993773 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 22504230, while the sum is 61.
The square root of 5972993773 is about 77285.1458755174. The cubic root of 5972993773 is about 1814.3901826535.
The spelling of 5972993773 in words is "five billion, nine hundred seventy-two million, nine hundred ninety-three thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •