Base | Representation |
---|---|
bin | 10110110011010111000100… |
… | …10101100101100101100101 |
3 | 20120112122110222212210212202 |
4 | 23121223202111211211211 |
5 | 23033021331323221201 |
6 | 254351253342024245 |
7 | 13363505240321360 |
oct | 1331534225454545 |
9 | 216478428783782 |
10 | 50143245523301 |
11 | 14a826a3958997 |
12 | 575a11b578085 |
13 | 21c9645802358 |
14 | c54d35cb10d7 |
15 | 5be51a772c6b |
hex | 2d9ae2565965 |
50143245523301 has 16 divisors (see below), whose sum is σ = 57378945740160. Its totient is φ = 42925655367360.
The previous prime is 50143245523277. The next prime is 50143245523313. The reversal of 50143245523301 is 10332554234105.
It is a cyclic number.
It is not a de Polignac number, because 50143245523301 - 222 = 50143241328997 is a prime.
It is a super-2 number, since 2×501432455233012 (a number of 28 digits) contains 22 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 (50143245523381) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39171971 + ... + 40431791.
It is an arithmetic number, because the mean of its divisors is an integer number (3586184108760).
Almost surely, 250143245523301 is an apocalyptic number.
It is an amenable number.
50143245523301 is a deficient number, since it is larger than the sum of its proper divisors (7235700216859).
50143245523301 is a wasteful number, since it uses less digits than its factorization.
50143245523301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1267004.
The product of its (nonzero) digits is 216000, while the sum is 38.
Adding to 50143245523301 its reverse (10332554234105), we get a palindrome (60475799757406).
The spelling of 50143245523301 in words is "fifty trillion, one hundred forty-three billion, two hundred forty-five million, five hundred twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •