Base | Representation |
---|---|
bin | 1010100101111011… |
… | …01001001010000001 |
3 | 112200022211100010001 |
4 | 11102331221022001 |
5 | 43121313431434 |
6 | 2340145040001 |
7 | 260632333003 |
oct | 52275511201 |
9 | 15608740101 |
10 | 5686858369 |
11 | 24590a0955 |
12 | 1128626001 |
13 | 6c824946a |
14 | 3bd3b8373 |
15 | 2343d0114 |
hex | 152f69281 |
5686858369 has 2 divisors, whose sum is σ = 5686858370. Its totient is φ = 5686858368.
The previous prime is 5686858321. The next prime is 5686858381. The reversal of 5686858369 is 9638586865.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5638207744 + 48650625 = 75088^2 + 6975^2 .
It is a cyclic number.
It is not a de Polignac number, because 5686858369 - 217 = 5686727297 is a prime.
It is a super-3 number, since 3×56868583693 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 5686858369.
It is not a weakly prime, because it can be changed into another prime (5686858069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2843429184 + 2843429185.
It is an arithmetic number, because the mean of its divisors is an integer number (2843429185).
Almost surely, 25686858369 is an apocalyptic number.
It is an amenable number.
5686858369 is a deficient number, since it is larger than the sum of its proper divisors (1).
5686858369 is an equidigital number, since it uses as much as digits as its factorization.
5686858369 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 74649600, while the sum is 64.
The square root of 5686858369 is about 75411.2615529007. The cubic root of 5686858369 is about 1784.9421181345.
The spelling of 5686858369 in words is "five billion, six hundred eighty-six million, eight hundred fifty-eight thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •