Base | Representation |
---|---|
bin | 101111000100101110… |
… | …101110101010000001 |
3 | 11211110120202102210020 |
4 | 233010232232222001 |
5 | 1312004034134241 |
6 | 35115315324053 |
7 | 3436362214014 |
oct | 570456565201 |
9 | 154416672706 |
10 | 50545224321 |
11 | 1a488509169 |
12 | 99675b0629 |
13 | 49c69ca577 |
14 | 2636cd937b |
15 | 14ac692b66 |
hex | bc4baea81 |
50545224321 has 8 divisors (see below), whose sum is σ = 67502509920. Its totient is φ = 33642377472.
The previous prime is 50545224293. The next prime is 50545224329. The reversal of 50545224321 is 12342254505.
It is a happy number.
50545224321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50545224321 - 29 = 50545223809 is a prime.
It is a super-2 number, since 2×505452243212 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (50545224329) 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, 13607520 + ... + 13611233.
It is an arithmetic number, because the mean of its divisors is an integer number (8437813740).
Almost surely, 250545224321 is an apocalyptic number.
It is an amenable number.
50545224321 is a deficient number, since it is larger than the sum of its proper divisors (16957285599).
50545224321 is a wasteful number, since it uses less digits than its factorization.
50545224321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27219375.
The product of its (nonzero) digits is 48000, while the sum is 33.
Adding to 50545224321 its reverse (12342254505), we get a palindrome (62887478826).
The spelling of 50545224321 in words is "fifty billion, five hundred forty-five million, two hundred twenty-four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •