Base | Representation |
---|---|
bin | 1001000110101001110… |
… | …1110101111010100100 |
3 | 112221201010122210000210 |
4 | 2101222131311322210 |
5 | 10030304141434224 |
6 | 155503530335420 |
7 | 14204601552516 |
oct | 2215235657244 |
9 | 487633583023 |
10 | 156405030564 |
11 | 60370620442 |
12 | 2638b88a570 |
13 | 1199752b483 |
14 | 77da2b3bb6 |
15 | 4106071429 |
hex | 246a775ea4 |
156405030564 has 48 divisors (see below), whose sum is σ = 378020966400. Its totient is φ = 50271707136.
The previous prime is 156405030557. The next prime is 156405030569. The reversal of 156405030564 is 465030504651.
156405030564 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (156405030569) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24612 + ... + 559835.
It is an arithmetic number, because the mean of its divisors is an integer number (7875436800).
Almost surely, 2156405030564 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 156405030564, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189010483200).
156405030564 is an abundant number, since it is smaller than the sum of its proper divisors (221615935836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156405030564 is a wasteful number, since it uses less digits than its factorization.
156405030564 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 585252 (or 585250 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 39.
The spelling of 156405030564 in words is "one hundred fifty-six billion, four hundred five million, thirty thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •