Base | Representation |
---|---|
bin | 110011101111100… |
… | …100010101111001 |
3 | 2020111111102210212 |
4 | 303233210111321 |
5 | 3234213421031 |
6 | 222050320505 |
7 | 30340536032 |
oct | 6357442571 |
9 | 2214442725 |
10 | 868107641 |
11 | 40602a135 |
12 | 202889135 |
13 | 10ab0b27b |
14 | 83417a89 |
15 | 5132c12b |
hex | 33be4579 |
868107641 has 2 divisors, whose sum is σ = 868107642. Its totient is φ = 868107640.
The previous prime is 868107623. The next prime is 868107649. The reversal of 868107641 is 146701868.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 735765625 + 132342016 = 27125^2 + 11504^2 .
It is a cyclic number.
It is not a de Polignac number, because 868107641 - 226 = 800998777 is a prime.
It is a super-3 number, since 3×8681076413 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Chen prime.
It is equal to p44461994 and since 868107641 and 44461994 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (868107649) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 434053820 + 434053821.
It is an arithmetic number, because the mean of its divisors is an integer number (434053821).
Almost surely, 2868107641 is an apocalyptic number.
It is an amenable number.
868107641 is a deficient number, since it is larger than the sum of its proper divisors (1).
868107641 is an equidigital number, since it uses as much as digits as its factorization.
868107641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64512, while the sum is 41.
The square root of 868107641 is about 29463.6664554838. Note that the first 3 decimals coincide. The cubic root of 868107641 is about 953.9476144235.
The spelling of 868107641 in words is "eight hundred sixty-eight million, one hundred seven thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •