Base | Representation |
---|---|
bin | 10111010110110111010000… |
… | …01110111101011000001100 |
3 | 20201212021011210211002210021 |
4 | 23223123220032331120030 |
5 | 23213013124440123400 |
6 | 301123520033551524 |
7 | 13550601606211531 |
oct | 1353335016753014 |
9 | 221767153732707 |
10 | 51363115161100 |
11 | 15402a7a524a46 |
12 | 59166234155a4 |
13 | 22876a0780392 |
14 | c97db9268d88 |
15 | 5e1114a2871a |
hex | 2eb6e83bd60c |
51363115161100 has 18 divisors (see below), whose sum is σ = 111457959899804. Its totient is φ = 20545246064400.
The previous prime is 51363115161091. The next prime is 51363115161101. The reversal of 51363115161100 is 116151136315.
51363115161100 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (51363115161101) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 256815575706 + ... + 256815575905.
Almost surely, 251363115161100 is an apocalyptic number.
51363115161100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
51363115161100 is an abundant number, since it is smaller than the sum of its proper divisors (60094844738704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51363115161100 is a wasteful number, since it uses less digits than its factorization.
51363115161100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 513631151625 (or 513631151618 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 34.
Adding to 51363115161100 its reverse (116151136315), we get a palindrome (51479266297415).
The spelling of 51363115161100 in words is "fifty-one trillion, three hundred sixty-three billion, one hundred fifteen million, one hundred sixty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.234 sec. • engine limits •