Base | Representation |
---|---|
bin | 101110101010111010… |
… | …111101111101101011 |
3 | 11210100101222210120012 |
4 | 232222322331331223 |
5 | 1310112212201011 |
6 | 35004330522135 |
7 | 3422553612503 |
oct | 565272757553 |
9 | 153311883505 |
10 | 50112225131 |
11 | 1a2860544a1 |
12 | 986659634b |
13 | 49580a3b27 |
14 | 25d55c4a03 |
15 | 1484661a8b |
hex | baaebdf6b |
50112225131 has 8 divisors (see below), whose sum is σ = 53704289184. Its totient is φ = 46637933760.
The previous prime is 50112225109. The next prime is 50112225139. The reversal of 50112225131 is 13152221105.
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 50112225131 - 222 = 50108030827 is a prime.
It is a super-2 number, since 2×501122251312 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50112225097 and 50112225106.
It is not an unprimeable number, because it can be changed into a prime (50112225139) 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, 29442290 + ... + 29443991.
It is an arithmetic number, because the mean of its divisors is an integer number (6713036148).
Almost surely, 250112225131 is an apocalyptic number.
50112225131 is a deficient number, since it is larger than the sum of its proper divisors (3592064053).
50112225131 is a wasteful number, since it uses less digits than its factorization.
50112225131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58886341.
The product of its (nonzero) digits is 600, while the sum is 23.
Adding to 50112225131 its reverse (13152221105), we get a palindrome (63264446236).
The spelling of 50112225131 in words is "fifty billion, one hundred twelve million, two hundred twenty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •