Base | Representation |
---|---|
bin | 100101000111101011010… |
… | …0101011111110011000100 |
3 | 200001201110002011022220200 |
4 | 1022033112211133303010 |
5 | 1132041313420143043 |
6 | 14503411204530500 |
7 | 1034405351222613 |
oct | 112172645376304 |
9 | 20051402138820 |
10 | 5101726334148 |
11 | 16976a2571aa4 |
12 | 6a48b99b0a30 |
13 | 2b01244407b2 |
14 | 138cd3bc587a |
15 | 8ca932b27d3 |
hex | 4a3d695fcc4 |
5101726334148 has 36 divisors (see below), whose sum is σ = 12896876323968. Its totient is φ = 1700463901680.
The previous prime is 5101726334147. The next prime is 5101726334191. The reversal of 5101726334148 is 8414336271015.
5101726334148 is a `hidden beast` number, since 5 + 1 + 0 + 1 + 7 + 2 + 633 + 4 + 1 + 4 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×51017263341482 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5101726334147) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 4090236 + ... + 5189747.
Almost surely, 25101726334148 is an apocalyptic number.
It is an amenable number.
5101726334148 is an abundant number, since it is smaller than the sum of its proper divisors (7795149989820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5101726334148 is a wasteful number, since it uses less digits than its factorization.
5101726334148 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9295264 (or 9295259 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 45.
The spelling of 5101726334148 in words is "five trillion, one hundred one billion, seven hundred twenty-six million, three hundred thirty-four thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •