Base | Representation |
---|---|
bin | 100100011011001001100… |
… | …1011010010100001100000 |
3 | 122201120122010211122201012 |
4 | 1020312103023102201200 |
5 | 1124010001131010143 |
6 | 14351435015400052 |
7 | 1024451655561221 |
oct | 110662313224140 |
9 | 18646563748635 |
10 | 5006106110048 |
11 | 16600944323aa |
12 | 68a272983028 |
13 | 2a40c6132934 |
14 | 1344226d7248 |
15 | 8a348819418 |
hex | 48d932d2860 |
5006106110048 has 24 divisors (see below), whose sum is σ = 9861050456712. Its totient is φ = 2501712343296.
The previous prime is 5006106110041. The next prime is 5006106110053. The reversal of 5006106110048 is 8400116016005.
It is a super-2 number, since 2×50061061100482 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 5006106109996 and 5006106110023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5006106110041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41836565 + ... + 41956052.
It is an arithmetic number, because the mean of its divisors is an integer number (410877102363).
Almost surely, 25006106110048 is an apocalyptic number.
It is an amenable number.
5006106110048 is a deficient number, since it is larger than the sum of its proper divisors (4854944346664).
5006106110048 is a wasteful number, since it uses less digits than its factorization.
5006106110048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83794494 (or 83794486 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 32.
The spelling of 5006106110048 in words is "five trillion, six billion, one hundred six million, one hundred ten thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •