Base | Representation |
---|---|
bin | 1100001011111… |
… | …1010101101100 |
3 | 10120011221002221 |
4 | 3002333111230 |
5 | 101041142442 |
6 | 5023325124 |
7 | 1160321260 |
oct | 302772554 |
9 | 116157087 |
10 | 51115372 |
11 | 26942810 |
12 | 151507a4 |
13 | a788ca9 |
14 | 6b080a0 |
15 | 474a467 |
hex | 30bf56c |
51115372 has 48 divisors (see below), whose sum is σ = 113234688. Its totient is φ = 19609920.
The previous prime is 51115369. The next prime is 51115381. The reversal of 51115372 is 27351115.
It is a super-2 number, since 2×511153722 = 5225562509396768, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19398 + ... + 21874.
It is an arithmetic number, because the mean of its divisors is an integer number (2359056).
Almost surely, 251115372 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 51115372, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56617344).
51115372 is an abundant number, since it is smaller than the sum of its proper divisors (62119316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51115372 is a wasteful number, since it uses less digits than its factorization.
51115372 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2566 (or 2564 counting only the distinct ones).
The product of its digits is 1050, while the sum is 25.
The square root of 51115372 is about 7149.5015210852. The cubic root of 51115372 is about 371.1224061672.
Adding to 51115372 its reverse (27351115), we get a palindrome (78466487).
It can be divided in two parts, 511153 and 72, that added together give a square (511225 = 7152).
The spelling of 51115372 in words is "fifty-one million, one hundred fifteen thousand, three hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •