Base | Representation |
---|---|
bin | 100101000111110110110… |
… | …0001010011010010110110 |
3 | 200001202102220011222121020 |
4 | 1022033231201103102312 |
5 | 1132043110421012301 |
6 | 14503513312002010 |
7 | 1034421032610216 |
oct | 112175541232266 |
9 | 20052386158536 |
10 | 5102111110326 |
11 | 169787a78a03a |
12 | 6a49a6830306 |
13 | 2b01860818c9 |
14 | 138d2cd46246 |
15 | 8cab6e6a436 |
hex | 4a3ed8534b6 |
5102111110326 has 8 divisors (see below), whose sum is σ = 10204222220664. Its totient is φ = 1700703703440.
The previous prime is 5102111110321. The next prime is 5102111110391. The reversal of 5102111110326 is 6230111112015.
It is a sphenic number, since it is the product of 3 distinct primes.
5102111110326 is an admirable number.
It is a super-2 number, since 2×51021111103262 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5102111110296 and 5102111110305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5102111110321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 425175925855 + ... + 425175925866.
It is an arithmetic number, because the mean of its divisors is an integer number (1275527777583).
Almost surely, 25102111110326 is an apocalyptic number.
5102111110326 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5102111110326 is a wasteful number, since it uses less digits than its factorization.
5102111110326 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 850351851726.
The product of its (nonzero) digits is 360, while the sum is 24.
The spelling of 5102111110326 in words is "five trillion, one hundred two billion, one hundred eleven million, one hundred ten thousand, three hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •