Base | Representation |
---|---|
bin | 101111100011001011… |
… | …100100001100000101 |
3 | 11212210012001121121102 |
4 | 233203023210030011 |
5 | 1314030330200401 |
6 | 35242125225445 |
7 | 3455134455536 |
oct | 574313441405 |
9 | 155705047542 |
10 | 51056100101 |
11 | 1a71a923756 |
12 | 9a8a702285 |
13 | 4a787bca26 |
14 | 2684ac268d |
15 | 14dc45856b |
hex | be32e4305 |
51056100101 has 8 divisors (see below), whose sum is σ = 52707383808. Its totient is φ = 49405086000.
The previous prime is 51056100077. The next prime is 51056100149. The reversal of 51056100101 is 10100165015.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51056100101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51056103101) 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 7 ways as a sum of consecutive naturals, for example, 360731 + ... + 481911.
It is an arithmetic number, because the mean of its divisors is an integer number (6588422976).
Almost surely, 251056100101 is an apocalyptic number.
It is an amenable number.
51056100101 is a deficient number, since it is larger than the sum of its proper divisors (1651283707).
51056100101 is a wasteful number, since it uses less digits than its factorization.
51056100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134803.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 51056100101 its reverse (10100165015), we get a palindrome (61156265116).
The spelling of 51056100101 in words is "fifty-one billion, fifty-six million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.233 sec. • engine limits •