Base | Representation |
---|---|
bin | 10110101111010011111100… |
… | …11010110111000000101000 |
3 | 20120001100101210220200222220 |
4 | 23113221332122313000220 |
5 | 23023231424314332222 |
6 | 254203325202314040 |
7 | 13350451650664656 |
oct | 1327517632670050 |
9 | 216040353820886 |
10 | 50004130230312 |
11 | 14a296a5a01275 |
12 | 5737176058920 |
13 | 21b94a5310c3b |
14 | c4c2d9d7bdd6 |
15 | 5baac755bb5c |
hex | 2d7a7e6b7028 |
50004130230312 has 16 divisors (see below), whose sum is σ = 125010325575840. Its totient is φ = 16668043410096.
The previous prime is 50004130230269. The next prime is 50004130230323. The reversal of 50004130230312 is 21303203140005.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 2083505426263 = 50004130230312 / (5 + 0 + 0 + 0 + 4 + 1 + 3 + 0 + 2 + 3 + 0 + 3 + 1 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1041752713108 + ... + 1041752713155.
It is an arithmetic number, because the mean of its divisors is an integer number (7813145348490).
Almost surely, 250004130230312 is an apocalyptic number.
It is an amenable number.
50004130230312 is an abundant number, since it is smaller than the sum of its proper divisors (75006195345528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50004130230312 is a wasteful number, since it uses less digits than its factorization.
50004130230312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2083505426272 (or 2083505426268 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 24.
Adding to 50004130230312 its reverse (21303203140005), we get a palindrome (71307333370317).
The spelling of 50004130230312 in words is "fifty trillion, four billion, one hundred thirty million, two hundred thirty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •