Base | Representation |
---|---|
bin | 1010100101011101… |
… | …11111100000000011 |
3 | 112200001121012202012 |
4 | 11102232333200003 |
5 | 43114323031411 |
6 | 2335530443135 |
7 | 260554565546 |
oct | 52256774003 |
9 | 15601535665 |
10 | 5683017731 |
11 | 2456a08376 |
12 | 11272934ab |
13 | 6c75032b1 |
14 | 3bca9885d |
15 | 233dc218b |
hex | 152bbf803 |
5683017731 has 2 divisors, whose sum is σ = 5683017732. Its totient is φ = 5683017730.
The previous prime is 5683017689. The next prime is 5683017733. The reversal of 5683017731 is 1377103865.
5683017731 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5683017731 - 210 = 5683016707 is a prime.
It is a super-2 number, since 2×56830177312 = 64593381061720776722, which contains 22 as substring.
Together with 5683017733, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (5683017733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2841508865 + 2841508866.
It is an arithmetic number, because the mean of its divisors is an integer number (2841508866).
Almost surely, 25683017731 is an apocalyptic number.
5683017731 is a deficient number, since it is larger than the sum of its proper divisors (1).
5683017731 is an equidigital number, since it uses as much as digits as its factorization.
5683017731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 105840, while the sum is 41.
The square root of 5683017731 is about 75385.7926336256. The cubic root of 5683017731 is about 1784.5402055192.
The spelling of 5683017731 in words is "five billion, six hundred eighty-three million, seventeen thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •