Base | Representation |
---|---|
bin | 111000111101111111010110… |
… | …0010110101001100001011100 |
3 | 2102201020210022201212002120220 |
4 | 1301323332230112221201130 |
5 | 1011140014342334310022 |
6 | 4533430344151041340 |
7 | 210356232303216663 |
oct | 16173765426514134 |
9 | 2381223281762526 |
10 | 501101021010012 |
11 | 135736827757795 |
12 | 4825089a070250 |
13 | 1867b814b541a7 |
14 | 8ba55c137ddda |
15 | 3cdebc2d3085c |
hex | 1c7bfac5a985c |
501101021010012 has 48 divisors (see below), whose sum is σ = 1169340097443840. Its totient is φ = 167018762852928.
The previous prime is 501101021009903. The next prime is 501101021010167. The reversal of 501101021010012 is 210010120101105.
It is a super-2 number, since 2×5011010210100122 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 501101021009973 and 501101021010000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10137769314 + ... + 10137818742.
It is an arithmetic number, because the mean of its divisors is an integer number (24361252030080).
Almost surely, 2501101021010012 is an apocalyptic number.
It is an amenable number.
501101021010012 is an abundant number, since it is smaller than the sum of its proper divisors (668239076433828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
501101021010012 is a wasteful number, since it uses less digits than its factorization.
501101021010012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107762 (or 107760 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 15.
Adding to 501101021010012 its reverse (210010120101105), we get a palindrome (711111141111117).
The spelling of 501101021010012 in words is "five hundred one trillion, one hundred one billion, twenty-one million, ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •