Base | Representation |
---|---|
bin | 10110110101000110111011… |
… | …11011000101101110000111 |
3 | 20120202101111100212122111102 |
4 | 23122203131323011232013 |
5 | 23040012330024312221 |
6 | 254435024511330315 |
7 | 13401032412455651 |
oct | 1332433573055607 |
9 | 216671440778442 |
10 | 50203301010311 |
11 | 14aa6111694189 |
12 | 576989bb2099b |
13 | 22021c68b9297 |
14 | c57bd1c896d1 |
15 | 5c0d82cd630b |
hex | 2da8ddec5b87 |
50203301010311 has 8 divisors (see below), whose sum is σ = 50808536755200. Its totient is φ = 49598074234552.
The previous prime is 50203301010293. The next prime is 50203301010319. The reversal of 50203301010311 is 11301010330205.
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 50203301010311 - 214 = 50203300993927 is a prime.
It is a super-3 number, since 3×502033010103113 (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 (50203301010319) 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, 9380876 + ... + 13726158.
It is an arithmetic number, because the mean of its divisors is an integer number (6351067094400).
Almost surely, 250203301010311 is an apocalyptic number.
50203301010311 is a deficient number, since it is larger than the sum of its proper divisors (605235744889).
50203301010311 is a wasteful number, since it uses less digits than its factorization.
50203301010311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4484565.
The product of its (nonzero) digits is 270, while the sum is 20.
Adding to 50203301010311 its reverse (11301010330205), we get a palindrome (61504311340516).
The spelling of 50203301010311 in words is "fifty trillion, two hundred three billion, three hundred one million, ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •