Base | Representation |
---|---|
bin | 10110110011000011001001… |
… | …10101011010000101111101 |
3 | 20120111121212121100222112221 |
4 | 23121201210311122011331 |
5 | 23032332430300013041 |
6 | 254342324151525341 |
7 | 13362646216014565 |
oct | 1331414465320575 |
9 | 216447777328487 |
10 | 50132550001021 |
11 | 14a79105582784 |
12 | 5758035689851 |
13 | 21c862c9b2947 |
14 | c545dd61bda5 |
15 | 5be0e17c92d1 |
hex | 2d9864d5a17d |
50132550001021 has 4 divisors (see below), whose sum is σ = 51749729033344. Its totient is φ = 48515370968700.
The previous prime is 50132550000979. The next prime is 50132550001033. The reversal of 50132550001021 is 12010005523105.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 50132550001021 - 217 = 50132549869949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50132553001021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 808589516115 + ... + 808589516176.
It is an arithmetic number, because the mean of its divisors is an integer number (12937432258336).
Almost surely, 250132550001021 is an apocalyptic number.
It is an amenable number.
50132550001021 is a deficient number, since it is larger than the sum of its proper divisors (1617179032323).
50132550001021 is a wasteful number, since it uses less digits than its factorization.
50132550001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1617179032322.
The product of its (nonzero) digits is 1500, while the sum is 25.
Adding to 50132550001021 its reverse (12010005523105), we get a palindrome (62142555524126).
The spelling of 50132550001021 in words is "fifty trillion, one hundred thirty-two billion, five hundred fifty million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •