Base | Representation |
---|---|
bin | 100011010101111001010100… |
… | …010010010100000010000100 |
3 | 202101100120012122101010100220 |
4 | 203111321110102110002010 |
5 | 130333132000303412103 |
6 | 1310330235210304340 |
7 | 44511620634626622 |
oct | 4325712422240204 |
9 | 671316178333326 |
10 | 155436280529028 |
11 | 4558817a163604 |
12 | 15524713a280b0 |
13 | 6896769870765 |
14 | 2a55228564512 |
15 | 12e83c3720c53 |
hex | 8d5e54494084 |
155436280529028 has 384 divisors, whose sum is σ = 389649884811264. Its totient is φ = 48122416742400.
The previous prime is 155436280529021. The next prime is 155436280529087. The reversal of 155436280529028 is 820925082634551.
It is not an unprimeable number, because it can be changed into a prime (155436280529021) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 316570835863 + ... + 316570836353.
It is an arithmetic number, because the mean of its divisors is an integer number (1014713241696).
Almost surely, 2155436280529028 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 155436280529028, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (194824942405632).
155436280529028 is an abundant number, since it is smaller than the sum of its proper divisors (234213604282236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155436280529028 is a wasteful number, since it uses less digits than its factorization.
155436280529028 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1435 (or 1433 counting only the distinct ones).
The product of its (nonzero) digits is 41472000, while the sum is 60.
The spelling of 155436280529028 in words is "one hundred fifty-five trillion, four hundred thirty-six billion, two hundred eighty million, five hundred twenty-nine thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •