Base | Representation |
---|---|
bin | 101111001001110111… |
… | …011101111100011111 |
3 | 11211200120220200022020 |
4 | 233021313131330133 |
5 | 1312143114314442 |
6 | 35132034351223 |
7 | 3441456544500 |
oct | 571167357437 |
9 | 154616820266 |
10 | 50631401247 |
11 | 1a522119169 |
12 | 999042b513 |
13 | 4a0b81132b |
14 | 264452cba7 |
15 | 14b50169ec |
hex | bc9dddf1f |
50631401247 has 48 divisors (see below), whose sum is σ = 79683351552. Its totient is φ = 28508215680.
The previous prime is 50631401203. The next prime is 50631401263. The reversal of 50631401247 is 74210413605.
It is not a de Polignac number, because 50631401247 - 211 = 50631399199 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50631401297) 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, 16813972 + ... + 16816982.
It is an arithmetic number, because the mean of its divisors is an integer number (1660069824).
Almost surely, 250631401247 is an apocalyptic number.
50631401247 is a deficient number, since it is larger than the sum of its proper divisors (29051950305).
50631401247 is a wasteful number, since it uses less digits than its factorization.
50631401247 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4668 (or 4661 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 33.
The spelling of 50631401247 in words is "fifty billion, six hundred thirty-one million, four hundred one thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •