Base | Representation |
---|---|
bin | 1000100110001… |
… | …10001010011000 |
3 | 12000200210222000 |
4 | 10103012022120 |
5 | 121430133330 |
6 | 11053401000 |
7 | 1533652230 |
oct | 423061230 |
9 | 160623860 |
10 | 72114840 |
11 | 37785a46 |
12 | 20199160 |
13 | 11c2c305 |
14 | 9812cc0 |
15 | 64e7560 |
hex | 44c6298 |
72114840 has 128 divisors (see below), whose sum is σ = 274752000. Its totient is φ = 16481664.
The previous prime is 72114829. The next prime is 72114857. The reversal of 72114840 is 4841127.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2791 + ... + 12329.
It is an arithmetic number, because the mean of its divisors is an integer number (2146500).
Almost surely, 272114840 is an apocalyptic number.
72114840 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 72114840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137376000).
72114840 is an abundant number, since it is smaller than the sum of its proper divisors (202637160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72114840 is a wasteful number, since it uses less digits than its factorization.
72114840 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9566 (or 9556 counting only the distinct ones).
The product of its (nonzero) digits is 1792, while the sum is 27.
The square root of 72114840 is about 8492.0456899383. The cubic root of 72114840 is about 416.2378293658.
Adding to 72114840 its reverse (4841127), we get a palindrome (76955967).
The spelling of 72114840 in words is "seventy-two million, one hundred fourteen thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •