Base | Representation |
---|---|
bin | 110011110011100… |
… | …000100100111111 |
3 | 2020120102221000222 |
4 | 303303200210333 |
5 | 3240000001144 |
6 | 222124411555 |
7 | 30352401122 |
oct | 6363404477 |
9 | 2216387028 |
10 | 869140799 |
11 | 40667538a |
12 | 2030a6bbb |
13 | 10b0b05c7 |
14 | 836063b9 |
15 | 514832ee |
hex | 33ce093f |
869140799 has 8 divisors (see below), whose sum is σ = 886207392. Its totient is φ = 852099040.
The previous prime is 869140787. The next prime is 869140801. The reversal of 869140799 is 997041968.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 869140799 - 28 = 869140543 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (53).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 869140799.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (869140739) 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 in 7 ways as a sum of consecutive naturals, for example, 74657 + ... + 85509.
It is an arithmetic number, because the mean of its divisors is an integer number (110775924).
Almost surely, 2869140799 is an apocalyptic number.
869140799 is a deficient number, since it is larger than the sum of its proper divisors (17066593).
869140799 is a wasteful number, since it uses less digits than its factorization.
869140799 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12417.
The product of its (nonzero) digits is 979776, while the sum is 53.
The square root of 869140799 is about 29481.1939887108. The cubic root of 869140799 is about 954.3259038712.
The spelling of 869140799 in words is "eight hundred sixty-nine million, one hundred forty thousand, seven hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •