Base | Representation |
---|---|
bin | 1000100101110… |
… | …11100110000000 |
3 | 12000121121120202 |
4 | 10102323212000 |
5 | 121422242202 |
6 | 11052424332 |
7 | 1533412100 |
oct | 422734600 |
9 | 160547522 |
10 | 72071552 |
11 | 37756473 |
12 | 201780a8 |
13 | 11c156b7 |
14 | 9801200 |
15 | 64d9802 |
hex | 44bb980 |
72071552 has 48 divisors (see below), whose sum is σ = 167036220. Its totient is φ = 30885120.
The previous prime is 72071533. The next prime is 72071557. The reversal of 72071552 is 25517027.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (72071557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 527 + ... + 12017.
Almost surely, 272071552 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 72071552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (83518110).
72071552 is an abundant number, since it is smaller than the sum of its proper divisors (94964668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72071552 is a wasteful number, since it uses less digits than its factorization.
72071552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11519 (or 11500 counting only the distinct ones).
The product of its (nonzero) digits is 4900, while the sum is 29.
The square root of 72071552 is about 8489.4965692908. The cubic root of 72071552 is about 416.1545283902.
Adding to 72071552 its reverse (25517027), we get a palindrome (97588579).
It can be divided in two parts, 7 and 2071552, that multiplied together give a square (14500864 = 38082).
The spelling of 72071552 in words is "seventy-two million, seventy-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •