Base | Representation |
---|---|
bin | 101110101011011110… |
… | …110110011000010011 |
3 | 11210101001200200100000 |
4 | 232223132312120103 |
5 | 1310122114200001 |
6 | 35005304301043 |
7 | 3423026556546 |
oct | 565336663023 |
9 | 153331620300 |
10 | 50121631251 |
11 | 1a29039944a |
12 | 9869771783 |
13 | 495a018293 |
14 | 25d695285d |
15 | 14853bda86 |
hex | bab7b6613 |
50121631251 has 48 divisors (see below), whose sum is σ = 77474019168. Its totient is φ = 32360601600.
The previous prime is 50121631247. The next prime is 50121631279. The reversal of 50121631251 is 15213612105.
50121631251 is a `hidden beast` number, since 5 + 0 + 1 + 2 + 1 + 631 + 25 + 1 = 666.
It is not a de Polignac number, because 50121631251 - 22 = 50121631247 is a prime.
It is a super-2 number, since 2×501216312512 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (50121635251) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1346571 + ... + 1383291.
It is an arithmetic number, because the mean of its divisors is an integer number (1614042066).
Almost surely, 250121631251 is an apocalyptic number.
50121631251 is a deficient number, since it is larger than the sum of its proper divisors (27352387917).
50121631251 is a wasteful number, since it uses less digits than its factorization.
50121631251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36914 (or 36902 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
The spelling of 50121631251 in words is "fifty billion, one hundred twenty-one million, six hundred thirty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •