Base | Representation |
---|---|
bin | 1110100101110011100… |
… | …10111110011010011100 |
3 | 1202221000210011010021012 |
4 | 13102321302332122130 |
5 | 31203212314313030 |
6 | 1022150453354352 |
7 | 51135336125243 |
oct | 7227162763234 |
9 | 1687023133235 |
10 | 501333354140 |
11 | 183683677173 |
12 | 811b36389b8 |
13 | 38377463618 |
14 | 1a39c34795a |
15 | d092c11095 |
hex | 74b9cbe69c |
501333354140 has 12 divisors (see below), whose sum is σ = 1052800043736. Its totient is φ = 200533341648.
The previous prime is 501333354113. The next prime is 501333354157. The reversal of 501333354140 is 41453333105.
It is a super-3 number, since 3×5013333541403 (a number of 36 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 501333354097 and 501333354106.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12533333834 + ... + 12533333873.
It is an arithmetic number, because the mean of its divisors is an integer number (87733336978).
Almost surely, 2501333354140 is an apocalyptic number.
It is an amenable number.
501333354140 is an abundant number, since it is smaller than the sum of its proper divisors (551466689596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
501333354140 is a wasteful number, since it uses less digits than its factorization.
501333354140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25066667716 (or 25066667714 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 32.
Adding to 501333354140 its reverse (41453333105), we get a palindrome (542786687245).
The spelling of 501333354140 in words is "five hundred one billion, three hundred thirty-three million, three hundred fifty-four thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •