Base | Representation |
---|---|
bin | 101110110000010101… |
… | …101101101011111111 |
3 | 11210120202000212012212 |
4 | 232300111231223333 |
5 | 1310303444404211 |
6 | 35021335051035 |
7 | 3425036333300 |
oct | 566025555377 |
9 | 153522025185 |
10 | 50203122431 |
11 | 1a322398a30 |
12 | 9890b10a7b |
13 | 4970b7b307 |
14 | 26036c67a7 |
15 | 148c61938b |
hex | bb056daff |
50203122431 has 24 divisors (see below), whose sum is σ = 63721987200. Its totient is φ = 39111097200.
The previous prime is 50203122397. The next prime is 50203122449. The reversal of 50203122431 is 13422130205.
It is not a de Polignac number, because 50203122431 - 214 = 50203106047 is a prime.
It is a super-2 number, since 2×502031224312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50203122397 and 50203122406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50203122481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4398470 + ... + 4409868.
It is an arithmetic number, because the mean of its divisors is an integer number (2655082800).
Almost surely, 250203122431 is an apocalyptic number.
50203122431 is a deficient number, since it is larger than the sum of its proper divisors (13518864769).
50203122431 is a wasteful number, since it uses less digits than its factorization.
50203122431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19595 (or 19588 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 50203122431 its reverse (13422130205), we get a palindrome (63625252636).
The spelling of 50203122431 in words is "fifty billion, two hundred three million, one hundred twenty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •