Base | Representation |
---|---|
bin | 1001000101101010100… |
… | …0111110001101001000 |
3 | 112221000122001001220220 |
4 | 2101122220332031020 |
5 | 10024233203401043 |
6 | 155421323350040 |
7 | 14165165650020 |
oct | 2213250761510 |
9 | 487018031826 |
10 | 156139512648 |
11 | 60244758949 |
12 | 26316982320 |
13 | 11954514792 |
14 | 77b2d18a80 |
15 | 40dcac4483 |
hex | 245aa3e348 |
156139512648 has 32 divisors (see below), whose sum is σ = 446112893760. Its totient is φ = 44611289280.
The previous prime is 156139512647. The next prime is 156139512679. The reversal of 156139512648 is 846215931651.
It is a self number, because there is not a number n which added to its sum of digits gives 156139512648.
It is not an unprimeable number, because it can be changed into a prime (156139512647) 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, 464700763 + ... + 464701098.
It is an arithmetic number, because the mean of its divisors is an integer number (13941027930).
Almost surely, 2156139512648 is an apocalyptic number.
It is an amenable number.
156139512648 is an abundant number, since it is smaller than the sum of its proper divisors (289973381112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156139512648 is a wasteful number, since it uses less digits than its factorization.
156139512648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 929401877 (or 929401873 counting only the distinct ones).
The product of its digits is 1555200, while the sum is 51.
The spelling of 156139512648 in words is "one hundred fifty-six billion, one hundred thirty-nine million, five hundred twelve thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •