Base | Representation |
---|---|
bin | 1000100010010… |
… | …11101001111100 |
3 | 11222202022122021 |
4 | 10101023221330 |
5 | 121313104202 |
6 | 11034525524 |
7 | 1526462260 |
oct | 421135174 |
9 | 158668567 |
10 | 71613052 |
11 | 37472a45 |
12 | 1bb968a4 |
13 | 11ab4ab4 |
14 | 97220a0 |
15 | 6448a37 |
hex | 444ba7c |
71613052 has 48 divisors (see below), whose sum is σ = 151683840. Its totient is φ = 28899072.
The previous prime is 71613041. The next prime is 71613089. The reversal of 71613052 is 25031617.
It is a super-3 number, since 3×716130523 (a number of 25 digits) contains 333 as substring.
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, 120468 + ... + 121060.
It is an arithmetic number, because the mean of its divisors is an integer number (3160080).
Almost surely, 271613052 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 71613052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75841920).
71613052 is an abundant number, since it is smaller than the sum of its proper divisors (80070788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71613052 is a wasteful number, since it uses less digits than its factorization.
71613052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 850 (or 848 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 25.
The square root of 71613052 is about 8462.4495271759. The cubic root of 71613052 is about 415.2701623083.
Adding to 71613052 its reverse (25031617), we get a palindrome (96644669).
The spelling of 71613052 in words is "seventy-one million, six hundred thirteen thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •