Base | Representation |
---|---|
bin | 10110110011100111101001… |
… | …01011111111111111111101 |
3 | 20120120111110002122212121200 |
4 | 23121303310223333333331 |
5 | 23033143042142320013 |
6 | 254355324312450113 |
7 | 13364241602344635 |
oct | 1331636453777775 |
9 | 216514402585550 |
10 | 50152143323133 |
11 | 14a8644a495675 |
12 | 575b9a33a9939 |
13 | 21ca43304b577 |
14 | c5553b8c16c5 |
15 | 5be88b9b2e73 |
hex | 2d9cf4affffd |
50152143323133 has 12 divisors (see below), whose sum is σ = 75591636313440. Its totient is φ = 31981076901576.
The previous prime is 50152143323111. The next prime is 50152143323137. The reversal of 50152143323133 is 33132334125105.
50152143323133 is a `hidden beast` number, since 5 + 0 + 1 + 5 + 2 + 1 + 4 + 332 + 313 + 3 = 666.
It is not a de Polignac number, because 50152143323133 - 26 = 50152143323069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50152143323137) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 121140442603 + ... + 121140443016.
It is an arithmetic number, because the mean of its divisors is an integer number (6299303026120).
Almost surely, 250152143323133 is an apocalyptic number.
It is an amenable number.
50152143323133 is a deficient number, since it is larger than the sum of its proper divisors (25439492990307).
50152143323133 is a wasteful number, since it uses less digits than its factorization.
50152143323133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 242280885648 (or 242280885645 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 36.
Adding to 50152143323133 its reverse (33132334125105), we get a palindrome (83284477448238).
The spelling of 50152143323133 in words is "fifty trillion, one hundred fifty-two billion, one hundred forty-three million, three hundred twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •