Base | Representation |
---|---|
bin | 101111101010110000… |
… | …110001001010001110 |
3 | 11220010001101200120010 |
4 | 233222300301022032 |
5 | 1314310410334240 |
6 | 35302511334050 |
7 | 3461240545530 |
oct | 575260611216 |
9 | 156101350503 |
10 | 51183293070 |
11 | 1a7856a8708 |
12 | 9b05221326 |
13 | 4a98c64940 |
14 | 2697951850 |
15 | 14e86d0280 |
hex | beac3128e |
51183293070 has 512 divisors, whose sum is σ = 166182912000. Its totient is φ = 9786562560.
The previous prime is 51183293059. The next prime is 51183293071. The reversal of 51183293070 is 7039238115.
51183293070 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51183293071) by changing a digit.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 223507716 + ... + 223507944.
It is an arithmetic number, because the mean of its divisors is an integer number (324576000).
Almost surely, 251183293070 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51183293070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (83091456000).
51183293070 is an abundant number, since it is smaller than the sum of its proper divisors (114999618930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51183293070 is a wasteful number, since it uses less digits than its factorization.
51183293070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 448.
The product of its (nonzero) digits is 45360, while the sum is 39.
The spelling of 51183293070 in words is "fifty-one billion, one hundred eighty-three million, two hundred ninety-three thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.175 sec. • engine limits •