Base | Representation |
---|---|
bin | 100101100010001100100… |
… | …0101101101000011001000 |
3 | 200021011110001020000221010 |
4 | 1023010121011231003020 |
5 | 1134004432210220021 |
6 | 14545510251443520 |
7 | 1041462550005504 |
oct | 113043105550310 |
9 | 20234401200833 |
10 | 5158676648136 |
11 | 17098675328a0 |
12 | 6b39524565a0 |
13 | 2b55cc10ac3b |
14 | 13b97761b304 |
15 | 8e2c7e09976 |
hex | 4b11916d0c8 |
5158676648136 has 32 divisors (see below), whose sum is σ = 14069118132000. Its totient is φ = 1563235347840.
The previous prime is 5158676648131. The next prime is 5158676648159. The reversal of 5158676648136 is 6318466768515.
It is a super-2 number, since 2×51586766481362 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is not an unprimeable number, because it can be changed into a prime (5158676648131) 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 7 ways as a sum of consecutive naturals, for example, 9770220661 + ... + 9770221188.
It is an arithmetic number, because the mean of its divisors is an integer number (439659941625).
Almost surely, 25158676648136 is an apocalyptic number.
It is an amenable number.
5158676648136 is an abundant number, since it is smaller than the sum of its proper divisors (8910441483864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5158676648136 is a wasteful number, since it uses less digits than its factorization.
5158676648136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19540441869 (or 19540441865 counting only the distinct ones).
The product of its digits is 174182400, while the sum is 66.
The spelling of 5158676648136 in words is "five trillion, one hundred fifty-eight billion, six hundred seventy-six million, six hundred forty-eight thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •