Base | Representation |
---|---|
bin | 110000001101111111… |
… | …110110111110010000 |
3 | 11221122020202122121111 |
4 | 300031333312332100 |
5 | 1322013224422400 |
6 | 35441310103104 |
7 | 3512006402014 |
oct | 601577667620 |
9 | 157566678544 |
10 | 51774451600 |
11 | 1aa59367883 |
12 | a04b1aaa94 |
13 | 4b615860a1 |
14 | 2712276544 |
15 | 15305533ba |
hex | c0dff6f90 |
51774451600 has 135 divisors (see below), whose sum is σ = 128881248561. Its totient is φ = 19987113600.
The previous prime is 51774451583. The next prime is 51774451639. The reversal of 51774451600 is 615447715.
The square root of 51774451600 is 227540.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 18638802576 + 33135649024 = 136524^2 + 182032^2 .
It is a Harshad number since it is a multiple of its sum of digits (40).
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 141074617 + ... + 141074983.
Almost surely, 251774451600 is an apocalyptic number.
51774451600 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
51774451600 is the 227540-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51774451600
51774451600 is an abundant number, since it is smaller than the sum of its proper divisors (77106796961).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51774451600 is an equidigital number, since it uses as much as digits as its factorization.
51774451600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 814 (or 405 counting only the distinct ones).
The product of its (nonzero) digits is 117600, while the sum is 40.
The spelling of 51774451600 in words is "fifty-one billion, seven hundred seventy-four million, four hundred fifty-one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •