Base | Representation |
---|---|
bin | 1001000111101… |
… | …01100110100100 |
3 | 12022221210000111 |
4 | 10203311212210 |
5 | 124041102320 |
6 | 11331422404 |
7 | 1616161105 |
oct | 443654644 |
9 | 168853014 |
10 | 76503460 |
11 | 3a203200 |
12 | 21754a04 |
13 | 12b07a27 |
14 | a2363ac |
15 | 6ab2a5a |
hex | 48f59a4 |
76503460 has 72 divisors (see below), whose sum is σ = 178908408. Its totient is φ = 27456000.
The previous prime is 76503409. The next prime is 76503461. The reversal of 76503460 is 6430567.
It can be written as a sum of positive squares in 4 ways, for example, as 5134756 + 71368704 = 2266^2 + 8448^2 .
It is not an unprimeable number, because it can be changed into a prime (76503461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 244264 + ... + 244576.
It is an arithmetic number, because the mean of its divisors is an integer number (2484839).
Almost surely, 276503460 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 76503460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (89454204).
76503460 is an abundant number, since it is smaller than the sum of its proper divisors (102404948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76503460 is a wasteful number, since it uses less digits than its factorization.
76503460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 445 (or 432 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 31.
The square root of 76503460 is about 8746.6256350664. The cubic root of 76503460 is about 424.5156373508.
The spelling of 76503460 in words is "seventy-six million, five hundred three thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •