Base | Representation |
---|---|
bin | 10110110010101011110010… |
… | …01001111001101000111111 |
3 | 20120110102111101122111102111 |
4 | 23121111321021321220333 |
5 | 23032131233014444201 |
6 | 254332451330434451 |
7 | 13362023320626433 |
oct | 1331257111715077 |
9 | 216412441574374 |
10 | 50120006015551 |
11 | 14a7385885183a |
12 | 5755714732a27 |
13 | 21c73b0c35434 |
14 | c53b6d6789c3 |
15 | 5bdb0a402b51 |
hex | 2d9579279a3f |
50120006015551 has 8 divisors (see below), whose sum is σ = 51687025362000. Its totient is φ = 48569395248960.
The previous prime is 50120006015543. The next prime is 50120006015561. The reversal of 50120006015551 is 15551060002105.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50120006015551 - 23 = 50120006015543 is a prime.
It is a super-3 number, since 3×501200060155513 (a number of 42 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50120006015561) 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, 4102138761 + ... + 4102150978.
It is an arithmetic number, because the mean of its divisors is an integer number (6460878170250).
Almost surely, 250120006015551 is an apocalyptic number.
50120006015551 is a deficient number, since it is larger than the sum of its proper divisors (1567019346449).
50120006015551 is a wasteful number, since it uses less digits than its factorization.
50120006015551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8204289929.
The product of its (nonzero) digits is 7500, while the sum is 31.
Adding to 50120006015551 its reverse (15551060002105), we get a palindrome (65671066017656).
The spelling of 50120006015551 in words is "fifty trillion, one hundred twenty billion, six million, fifteen thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •