Base | Representation |
---|---|
bin | 1101101100000100000101… |
… | …0101010001010010010010 |
3 | 1222021211101110220020100021 |
4 | 3123001001111101102102 |
5 | 3433042223321000200 |
6 | 52002102313214054 |
7 | 3112242264633661 |
oct | 333010125212222 |
9 | 58254343806307 |
10 | 15050661500050 |
11 | 4882a4a057390 |
12 | 1830b0410132a |
13 | 85236b03ba47 |
14 | 3a0654ddadd8 |
15 | 1b178012441a |
hex | db041551492 |
15050661500050 has 48 divisors (see below), whose sum is σ = 32146484680800. Its totient is φ = 5184916876800.
The previous prime is 15050661500047. The next prime is 15050661500101. The reversal of 15050661500050 is 5000516605051.
It is a junction number, because it is equal to n+sod(n) for n = 15050661499979 and 15050661500015.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 720116895 + ... + 720137794.
It is an arithmetic number, because the mean of its divisors is an integer number (669718430850).
Almost surely, 215050661500050 is an apocalyptic number.
15050661500050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
15050661500050 is an abundant number, since it is smaller than the sum of its proper divisors (17095823180750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15050661500050 is a wasteful number, since it uses less digits than its factorization.
15050661500050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1440254731 (or 1440254726 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 34.
The spelling of 15050661500050 in words is "fifteen trillion, fifty billion, six hundred sixty-one million, five hundred thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •