Base | Representation |
---|---|
bin | 10111001101110000001110… |
… | …11001111001110001100101 |
3 | 20200202100020121221101011001 |
4 | 23212320013121321301211 |
5 | 23142401104002323023 |
6 | 300324032242513301 |
7 | 13516151130120160 |
oct | 1346700731716145 |
9 | 220670217841131 |
10 | 51050105511013 |
11 | 152a2256762014 |
12 | 5885a29065831 |
13 | 226400958158b |
14 | c86ba43a8ad7 |
15 | 5d7de515d6ad |
hex | 2e6e07679c65 |
51050105511013 has 8 divisors (see below), whose sum is σ = 60354804545280. Its totient is φ = 42248363181360.
The previous prime is 51050105511011. The next prime is 51050105511079. The reversal of 51050105511013 is 31011550105015.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51050105511013 - 21 = 51050105511011 is a prime.
It is a super-2 number, since 2×510501055110132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51050105511011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 125739175933 + ... + 125739176338.
It is an arithmetic number, because the mean of its divisors is an integer number (7544350568160).
Almost surely, 251050105511013 is an apocalyptic number.
It is an amenable number.
51050105511013 is a deficient number, since it is larger than the sum of its proper divisors (9304699034267).
51050105511013 is a wasteful number, since it uses less digits than its factorization.
51050105511013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251478352307.
The product of its (nonzero) digits is 1875, while the sum is 28.
Adding to 51050105511013 its reverse (31011550105015), we get a palindrome (82061655616028).
The spelling of 51050105511013 in words is "fifty-one trillion, fifty billion, one hundred five million, five hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •