Base | Representation |
---|---|
bin | 1001000101011001110… |
… | …0000000000000000000 |
3 | 112220211201100211020020 |
4 | 2101112130000000000 |
5 | 10024112131101024 |
6 | 155410324213440 |
7 | 14163351432216 |
oct | 2212634000000 |
9 | 486751324206 |
10 | 156069003264 |
11 | 6020897a129 |
12 | 262b723a280 |
13 | 11942a28155 |
14 | 77a7802cb6 |
15 | 40d67e7979 |
hex | 2456700000 |
156069003264 has 84 divisors (see below), whose sum is σ = 416192198856. Its totient is φ = 52021952512.
The previous prime is 156069003263. The next prime is 156069003269. The reversal of 156069003264 is 462300960651.
156069003264 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (156069003263) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3120922 + ... + 3170534.
It is an arithmetic number, because the mean of its divisors is an integer number (4954669034).
Almost surely, 2156069003264 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 156069003264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (208096099428).
156069003264 is an abundant number, since it is smaller than the sum of its proper divisors (260123195592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156069003264 is an frugal number, since it uses more digits than its factorization.
156069003264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49656 (or 49618 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 42.
The spelling of 156069003264 in words is "one hundred fifty-six billion, sixty-nine million, three thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •