Base | Representation |
---|---|
bin | 10110111101110111011101… |
… | …11001111001001011101001 |
3 | 20121211011020212200011111120 |
4 | 23132323232321321023221 |
5 | 23104430132301321301 |
6 | 255225154041445453 |
7 | 13431544663445514 |
oct | 1336735671711351 |
9 | 217734225604446 |
10 | 50504233620201 |
11 | 151017a8266059 |
12 | 57b80857a0889 |
13 | 22246b49bb45a |
14 | c685bcbd5d7b |
15 | 5c8ae72b3e36 |
hex | 2deeeee792e9 |
50504233620201 has 8 divisors (see below), whose sum is σ = 67342463872320. Its totient is φ = 33667746224112.
The previous prime is 50504233620179. The next prime is 50504233620241. The reversal of 50504233620201 is 10202633240505.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50504233620201 - 230 = 50503159878377 is a prime.
It is a super-2 number, since 2×505042336202012 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (50504233620241) 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, 435646390 + ... + 435762303.
It is an arithmetic number, because the mean of its divisors is an integer number (8417807984040).
Almost surely, 250504233620201 is an apocalyptic number.
It is an amenable number.
50504233620201 is a deficient number, since it is larger than the sum of its proper divisors (16838230252119).
50504233620201 is a wasteful number, since it uses less digits than its factorization.
50504233620201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 871428015.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 50504233620201 its reverse (10202633240505), we get a palindrome (60706866860706).
The spelling of 50504233620201 in words is "fifty trillion, five hundred four billion, two hundred thirty-three million, six hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •