Base | Representation |
---|---|
bin | 101111111001101101… |
… | …100110001101000000 |
3 | 11220202112101000102102 |
4 | 233321231212031000 |
5 | 1320314113320000 |
6 | 35343431405532 |
7 | 3500404543424 |
oct | 577155461500 |
9 | 156675330372 |
10 | 51434120000 |
11 | 1a8a424669a |
12 | 9b752238a8 |
13 | 4b08c06843 |
14 | 26bcda4b84 |
15 | 15107293d5 |
hex | bf9b66340 |
51434120000 has 70 divisors (see below), whose sum is σ = 127540000698. Its totient is φ = 20573632000.
The previous prime is 51434119969. The next prime is 51434120009. The reversal of 51434120000 is 2143415.
It can be written as a sum of positive squares in 5 ways, for example, as 14206732864 + 37227387136 = 119192^2 + 192944^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51434120009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 602927 + ... + 682926.
Almost surely, 251434120000 is an apocalyptic number.
51434120000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
51434120000 is an abundant number, since it is smaller than the sum of its proper divisors (76105880698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51434120000 is an equidigital number, since it uses as much as digits as its factorization.
51434120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1285885 (or 1285860 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 51434120000 its reverse (2143415), we get a palindrome (51436263415).
The spelling of 51434120000 in words is "fifty-one billion, four hundred thirty-four million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •