Base | Representation |
---|---|
bin | 111001011011011001100010… |
… | …1110100001100111001111010 |
3 | 2110020120012102001210002102121 |
4 | 1302312303011310030321322 |
5 | 1012202230342134204200 |
6 | 4550203255110351454 |
7 | 211254243516241504 |
oct | 16266630564147172 |
9 | 2406505361702377 |
10 | 505143012413050 |
11 | 136a54a48501a30 |
12 | 487a412495b58a |
13 | 188b2a2145946b |
14 | 8ca50a3548d74 |
15 | 3d5ede0537e1a |
hex | 1cb6cc5d0ce7a |
505143012413050 has 96 divisors (see below), whose sum is σ = 1026827551848384. Its totient is φ = 183357494208000.
The previous prime is 505143012413033. The next prime is 505143012413063. The reversal of 505143012413050 is 50314210341505.
It is a junction number, because it is equal to n+sod(n) for n = 505143012412997 and 505143012413015.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11554819792 + ... + 11554863508.
It is an arithmetic number, because the mean of its divisors is an integer number (10696120331754).
Almost surely, 2505143012413050 is an apocalyptic number.
505143012413050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
505143012413050 is an abundant number, since it is smaller than the sum of its proper divisors (521684539435334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505143012413050 is a wasteful number, since it uses less digits than its factorization.
505143012413050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81104 (or 81099 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 34.
Adding to 505143012413050 its reverse (50314210341505), we get a palindrome (555457222754555).
The spelling of 505143012413050 in words is "five hundred five trillion, one hundred forty-three billion, twelve million, four hundred thirteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •