Base | Representation |
---|---|
bin | 1001000111010… |
… | …11100000111100 |
3 | 12022212200100010 |
4 | 10203223200330 |
5 | 124033242030 |
6 | 11330503220 |
7 | 1615626456 |
oct | 443534074 |
9 | 168780303 |
10 | 76462140 |
11 | 3a185157 |
12 | 21734b10 |
13 | 12ac1c91 |
14 | a2252d6 |
15 | 6aa56b0 |
hex | 48eb83c |
76462140 has 48 divisors (see below), whose sum is σ = 215484192. Its totient is φ = 20257536.
The previous prime is 76462129. The next prime is 76462163. The reversal of 76462140 is 4126467.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 76462098 and 76462107.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 5362 + ... + 13478.
It is an arithmetic number, because the mean of its divisors is an integer number (4489254).
Almost surely, 276462140 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 76462140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107742096).
76462140 is an abundant number, since it is smaller than the sum of its proper divisors (139022052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76462140 is a wasteful number, since it uses less digits than its factorization.
76462140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8286 (or 8284 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 30.
The square root of 76462140 is about 8744.2632622766. The cubic root of 76462140 is about 424.4391957316.
The spelling of 76462140 in words is "seventy-six million, four hundred sixty-two thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •