Base | Representation |
---|---|
bin | 1001000100011… |
… | …00000000101000 |
3 | 12022010210201200 |
4 | 10202030000220 |
5 | 123433232302 |
6 | 11314244200 |
7 | 1612410126 |
oct | 442140050 |
9 | 168123650 |
10 | 76070952 |
11 | 39a38261 |
12 | 21586660 |
13 | 129b5bc9 |
14 | a162916 |
15 | 6a2981c |
hex | 488c028 |
76070952 has 24 divisors (see below), whose sum is σ = 206025690. Its totient is φ = 25356960.
The previous prime is 76070933. The next prime is 76070977. The reversal of 76070952 is 25907067.
It can be written as a sum of positive squares in only one way, i.e., 62631396 + 13439556 = 7914^2 + 3666^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 528199 + ... + 528342.
Almost surely, 276070952 is an apocalyptic number.
76070952 is a gapful number since it is divisible by the number (72) formed by its first and last digit.
It is an amenable number.
76070952 is an abundant number, since it is smaller than the sum of its proper divisors (129954738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76070952 is a wasteful number, since it uses less digits than its factorization.
76070952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1056553 (or 1056546 counting only the distinct ones).
The product of its (nonzero) digits is 26460, while the sum is 36.
The square root of 76070952 is about 8721.8663140408. The cubic root of 76070952 is about 423.7141332840.
It can be divided in two parts, 760709 and 52, that added together give a triangular number (760761 = T1233).
The spelling of 76070952 in words is "seventy-six million, seventy thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •