Base | Representation |
---|---|
bin | 100101001001001111110… |
… | …1011000000101100000110 |
3 | 200002001011012022022110000 |
4 | 1022102133223000230012 |
5 | 1132120221100000011 |
6 | 14505130042142130 |
7 | 1034555065010256 |
oct | 112223753005406 |
9 | 20061135268400 |
10 | 5105100000006 |
11 | 16990739510a6 |
12 | 6a549b7b1946 |
13 | 2b0541376096 |
14 | 139133c99966 |
15 | 8cbde567356 |
hex | 4a49fac0b06 |
5105100000006 has 80 divisors (see below), whose sum is σ = 11500154520624. Its totient is φ = 1692637563456.
The previous prime is 5105099999981. The next prime is 5105100000029. The reversal of 5105100000006 is 6000000015015.
It is a super-2 number, since 2×51051000000062 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 143371801 + ... + 143407403.
Almost surely, 25105100000006 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5105100000006, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5750077260312).
5105100000006 is an abundant number, since it is smaller than the sum of its proper divisors (6395054520618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5105100000006 is a wasteful number, since it uses less digits than its factorization.
5105100000006 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40307 (or 40298 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The spelling of 5105100000006 in words is "five trillion, one hundred five billion, one hundred million, six", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •