Base | Representation |
---|---|
bin | 110011110000001… |
… | …010001111010011 |
3 | 2020111210022201222 |
4 | 303300022033103 |
5 | 3234233402432 |
6 | 222053515255 |
7 | 30342053423 |
oct | 6360121723 |
9 | 2214708658 |
10 | 868262867 |
11 | 40612581a |
12 | 202942b2b |
13 | 10ab63b14 |
14 | 83458483 |
15 | 5135d112 |
hex | 33c0a3d3 |
868262867 has 4 divisors (see below), whose sum is σ = 871490880. Its totient is φ = 865034856.
The previous prime is 868262839. The next prime is 868262869. The reversal of 868262867 is 768262868.
868262867 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-868262867 is a prime.
It is a super-2 number, since 2×8682628672 = 1507760812422119378, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (868262869) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1613603 + ... + 1614140.
It is an arithmetic number, because the mean of its divisors is an integer number (217872720).
Almost surely, 2868262867 is an apocalyptic number.
868262867 is a deficient number, since it is larger than the sum of its proper divisors (3228013).
868262867 is a wasteful number, since it uses less digits than its factorization.
868262867 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3228012.
The product of its digits is 3096576, while the sum is 53.
The square root of 868262867 is about 29466.3005312849. The cubic root of 868262867 is about 954.0044693727.
Subtracting from 868262867 its reverse (768262868), we obtain a palindrome (99999999).
The spelling of 868262867 in words is "eight hundred sixty-eight million, two hundred sixty-two thousand, eight hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •