Base | Representation |
---|---|
bin | 101101110011010… |
… | …110011110101101 |
3 | 1222112221121012211 |
4 | 231303112132231 |
5 | 3033204424031 |
6 | 204130130421 |
7 | 25020412414 |
oct | 5563263655 |
9 | 1875847184 |
10 | 768436141 |
11 | 3648424a0 |
12 | 195420a11 |
13 | c3281155 |
14 | 740b047b |
15 | 476debb1 |
hex | 2dcd67ad |
768436141 has 8 divisors (see below), whose sum is σ = 874741824. Its totient is φ = 668205120.
The previous prime is 768436129. The next prime is 768436147. The reversal of 768436141 is 141634867.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 768436141 - 27 = 768436013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 768436094 and 768436103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (768436147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1518396 + ... + 1518901.
It is an arithmetic number, because the mean of its divisors is an integer number (109342728).
Almost surely, 2768436141 is an apocalyptic number.
It is an amenable number.
768436141 is a deficient number, since it is larger than the sum of its proper divisors (106305683).
768436141 is a wasteful number, since it uses less digits than its factorization.
768436141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3037331.
The product of its digits is 96768, while the sum is 40.
The square root of 768436141 is about 27720.6807456094. The cubic root of 768436141 is about 915.9447142983.
The spelling of 768436141 in words is "seven hundred sixty-eight million, four hundred thirty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •