Base | Representation |
---|---|
bin | 100011011110010000001001… |
… | …101101100100010011100000 |
3 | 202110101110111211002220100220 |
4 | 203132100021231210103200 |
5 | 130422034104040000112 |
6 | 1311450132021243040 |
7 | 44601250663244445 |
oct | 4336201155442340 |
9 | 673343454086326 |
10 | 156010555000032 |
11 | 45789783124437 |
12 | 155b7a83263480 |
13 | 6908969887455 |
14 | 2a74d45d5d9cc |
15 | 13082d4d5498c |
hex | 8de409b644e0 |
156010555000032 has 48 divisors (see below), whose sum is σ = 409530680479872. Its totient is φ = 52003140732800.
The previous prime is 156010555000007. The next prime is 156010555000043. The reversal of 156010555000032 is 230000555010651.
It is a tau number, because it is divible by the number of its divisors (48).
It is a junction number, because it is equal to n+sod(n) for n = 156010554999957 and 156010555000002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7548907 + ... + 19209557.
It is an arithmetic number, because the mean of its divisors is an integer number (8531889176664).
Almost surely, 2156010555000032 is an apocalyptic number.
156010555000032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
156010555000032 is an abundant number, since it is smaller than the sum of its proper divisors (253520125479840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156010555000032 is a wasteful number, since it uses less digits than its factorization.
156010555000032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11800031 (or 11800023 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 33.
The spelling of 156010555000032 in words is "one hundred fifty-six trillion, ten billion, five hundred fifty-five million, thirty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •