Base | Representation |
---|---|
bin | 1010101010010100… |
… | …00110100100010001 |
3 | 112202220010000111212 |
4 | 11111022012210101 |
5 | 43210230211433 |
6 | 2343542145505 |
7 | 261560316524 |
oct | 52512064421 |
9 | 15686100455 |
10 | 5723678993 |
11 | 247795a81a |
12 | 1138a22295 |
13 | 702a6bb06 |
14 | 3c4240bbb |
15 | 237754d48 |
hex | 155286911 |
5723678993 has 2 divisors, whose sum is σ = 5723678994. Its totient is φ = 5723678992.
The previous prime is 5723678969. The next prime is 5723679019. The reversal of 5723678993 is 3998763275.
5723678993 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., 4857671809 + 866007184 = 69697^2 + 29428^2 .
It is a cyclic number.
It is not a de Polignac number, because 5723678993 - 26 = 5723678929 is a prime.
It is not a weakly prime, because it can be changed into another prime (5723678923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2861839496 + 2861839497.
It is an arithmetic number, because the mean of its divisors is an integer number (2861839497).
Almost surely, 25723678993 is an apocalyptic number.
It is an amenable number.
5723678993 is a deficient number, since it is larger than the sum of its proper divisors (1).
5723678993 is an equidigital number, since it uses as much as digits as its factorization.
5723678993 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 17146080, while the sum is 59.
The square root of 5723678993 is about 75654.9997885136. Note that the first 3 decimals coincide. The cubic root of 5723678993 is about 1788.7861471680.
The spelling of 5723678993 in words is "five billion, seven hundred twenty-three million, six hundred seventy-eight thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •