Base | Representation |
---|---|
bin | 100011011110111110110011… |
… | …100111011100001111111110 |
3 | 202110120020211000222202111121 |
4 | 203132332303213130033332 |
5 | 130423344202420124100 |
6 | 1311525134542341154 |
7 | 44605003252140040 |
oct | 4336766347341776 |
9 | 673506730882447 |
10 | 156060650161150 |
11 | 457a8a4a583439 |
12 | 15605723b8a7ba |
13 | 69105c1265317 |
14 | 2a77539181a90 |
15 | 1309767c4551a |
hex | 8defb39dc3fe |
156060650161150 has 48 divisors (see below), whose sum is σ = 331761961188000. Its totient is φ = 53503023513600.
The previous prime is 156060650161121. The next prime is 156060650161151. The reversal of 156060650161150 is 51161056060651.
It is a junction number, because it is equal to n+sod(n) for n = 156060650161097 and 156060650161106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (156060650161151) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9137275 + ... + 19889974.
It is an arithmetic number, because the mean of its divisors is an integer number (6911707524750).
Almost surely, 2156060650161150 is an apocalyptic number.
156060650161150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
156060650161150 is an abundant number, since it is smaller than the sum of its proper divisors (175701311026850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156060650161150 is a wasteful number, since it uses less digits than its factorization.
156060650161150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29042629 (or 29042624 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 43.
The spelling of 156060650161150 in words is "one hundred fifty-six trillion, sixty billion, six hundred fifty million, one hundred sixty-one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •