Base | Representation |
---|---|
bin | 10110101111010010001111… |
… | …10111101011111011001010 |
3 | 20120001021001000211020011220 |
4 | 23113221013313223323022 |
5 | 23023223041022241302 |
6 | 254203054310502510 |
7 | 13350420166002144 |
oct | 1327510767537312 |
9 | 216037030736156 |
10 | 50003215040202 |
11 | 14a29276344406 |
12 | 5736b5b664a36 |
13 | 21b938a829528 |
14 | c4c2505c9c94 |
15 | 5baa7202e4bc |
hex | 2d7a47debeca |
50003215040202 has 8 divisors (see below), whose sum is σ = 100006430080416. Its totient is φ = 16667738346732.
The previous prime is 50003215040201. The next prime is 50003215040213. The reversal of 50003215040202 is 20204051230005.
It is a sphenic number, since it is the product of 3 distinct primes.
50003215040202 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (50003215040201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4166934586678 + ... + 4166934586689.
It is an arithmetic number, because the mean of its divisors is an integer number (12500803760052).
Almost surely, 250003215040202 is an apocalyptic number.
50003215040202 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50003215040202 is a wasteful number, since it uses less digits than its factorization.
50003215040202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8333869173372.
The product of its (nonzero) digits is 2400, while the sum is 24.
Adding to 50003215040202 its reverse (20204051230005), we get a palindrome (70207266270207).
The spelling of 50003215040202 in words is "fifty trillion, three billion, two hundred fifteen million, forty thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •