Base | Representation |
---|---|
bin | 10110110110010000001100… |
… | …10101000110101010001101 |
3 | 20120220011000112010110100222 |
4 | 23123020012111012222031 |
5 | 23041133403201433310 |
6 | 254505051450001125 |
7 | 13403624204251451 |
oct | 1333100625065215 |
9 | 216804015113328 |
10 | 50242633624205 |
11 | 15010865949160 |
12 | 57754384161a5 |
13 | 2205b2460b109 |
14 | c59a8396c661 |
15 | 5c1dd5dde055 |
hex | 2db206546a8d |
50242633624205 has 8 divisors (see below), whose sum is σ = 65772174926304. Its totient is φ = 36540097181200.
The previous prime is 50242633624159. The next prime is 50242633624217.
It is a happy number.
50242633624205 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50242633624205 - 216 = 50242633558669 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 456751214711 + ... + 456751214820.
It is an arithmetic number, because the mean of its divisors is an integer number (8221521865788).
Almost surely, 250242633624205 is an apocalyptic number.
50242633624205 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50242633624205 is a deficient number, since it is larger than the sum of its proper divisors (15529541302099).
50242633624205 is a wasteful number, since it uses less digits than its factorization.
50242633624205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 913502429547.
The product of its (nonzero) digits is 2073600, while the sum is 44.
It can be divided in two parts, 5024263 and 3624205, that added together give a palindrome (8648468).
The spelling of 50242633624205 in words is "fifty trillion, two hundred forty-two billion, six hundred thirty-three million, six hundred twenty-four thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •