Base | Representation |
---|---|
bin | 101101011001111… |
… | …101100000101000 |
3 | 1222002102110001212 |
4 | 231121331200220 |
5 | 3030003432024 |
6 | 203331332252 |
7 | 24610011500 |
oct | 5531754050 |
9 | 1862373055 |
10 | 761780264 |
11 | 361006873 |
12 | 193151088 |
13 | c1a9076b |
14 | 7325aa00 |
15 | 46d27a0e |
hex | 2d67d828 |
761780264 has 48 divisors (see below), whose sum is σ = 1670310900. Its totient is φ = 324753408.
The previous prime is 761780233. The next prime is 761780269. The reversal of 761780264 is 462087167.
761780264 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 709796164 + 51984100 = 26642^2 + 7210^2 .
It is not an unprimeable number, because it can be changed into a prime (761780269) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 70622 + ... + 80690.
Almost surely, 2761780264 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 761780264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (835155450).
761780264 is an abundant number, since it is smaller than the sum of its proper divisors (908530636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
761780264 is a wasteful number, since it uses less digits than its factorization.
761780264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10282 (or 10271 counting only the distinct ones).
The product of its (nonzero) digits is 112896, while the sum is 41.
The square root of 761780264 is about 27600.3670990079. The cubic root of 761780264 is about 913.2925303076.
The spelling of 761780264 in words is "seven hundred sixty-one million, seven hundred eighty thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •