Base | Representation |
---|---|
bin | 10010101000000… |
… | …00110010110000 |
3 | 101212222212110101 |
4 | 21110000302300 |
5 | 304444203242 |
6 | 23300442144 |
7 | 3605012221 |
oct | 1124006260 |
9 | 355885411 |
10 | 156241072 |
11 | 80215259 |
12 | 443a9354 |
13 | 264a5850 |
14 | 16a71248 |
15 | dab39b7 |
hex | 9500cb0 |
156241072 has 40 divisors (see below), whose sum is σ = 327010320. Its totient is φ = 71888640.
The previous prime is 156241051. The next prime is 156241073. The reversal of 156241072 is 270142651.
It is a super-2 number, since 2×1562410722 = 48822545159418368, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 156241072.
It is not an unprimeable number, because it can be changed into a prime (156241073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 79947 + ... + 81877.
It is an arithmetic number, because the mean of its divisors is an integer number (8175258).
Almost surely, 2156241072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 156241072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163505160).
156241072 is an abundant number, since it is smaller than the sum of its proper divisors (170769248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156241072 is a wasteful number, since it uses less digits than its factorization.
156241072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2341 (or 2335 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 28.
The square root of 156241072 is about 12499.6428748985. The cubic root of 156241072 is about 538.5984137564.
The spelling of 156241072 in words is "one hundred fifty-six million, two hundred forty-one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •