Base | Representation |
---|---|
bin | 101111101101000100… |
… | …110011110000001000 |
3 | 11220012202102100000212 |
4 | 233231010303300020 |
5 | 1314400324213000 |
6 | 35310415220252 |
7 | 3462221450300 |
oct | 575504636010 |
9 | 156182370025 |
10 | 51222101000 |
11 | 1a7a55a4684 |
12 | 9b16217688 |
13 | 4aa4001a05 |
14 | 269cb74600 |
15 | 14ebce8c35 |
hex | bed133c08 |
51222101000 has 96 divisors (see below), whose sum is σ = 139428783000. Its totient is φ = 17561846400.
The previous prime is 51222100981. The next prime is 51222101003. The reversal of 51222101000 is 10122215.
It can be written as a sum of positive squares in 4 ways, for example, as 30034969636 + 21187131364 = 173306^2 + 145558^2 .
It is a Harshad number since it is a multiple of its sum of digits (14).
It is not an unprimeable number, because it can be changed into a prime (51222101003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 473675 + ... + 571674.
Almost surely, 251222101000 is an apocalyptic number.
51222101000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
51222101000 is an abundant number, since it is smaller than the sum of its proper divisors (88206682000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51222101000 is a wasteful number, since it uses less digits than its factorization.
51222101000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1045384 (or 1045363 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 14.
Adding to 51222101000 its reverse (10122215), we get a palindrome (51232223215).
The spelling of 51222101000 in words is "fifty-one billion, two hundred twenty-two million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •