Base | Representation |
---|---|
bin | 1001000001100111001… |
… | …1110010011000000000 |
3 | 112211012211101000002120 |
4 | 2100121303302120000 |
5 | 10020021232004421 |
6 | 155121350444240 |
7 | 14126220540630 |
oct | 2203163623000 |
9 | 484184330076 |
10 | 155051828736 |
11 | 5a836795922 |
12 | 26072663680 |
13 | 1181008692c |
14 | 770c6a46c0 |
15 | 40773728c6 |
hex | 2419cf2600 |
155051828736 has 320 divisors, whose sum is σ = 517100474880. Its totient is φ = 40255488000.
The previous prime is 155051828693. The next prime is 155051828747. The reversal of 155051828736 is 637828150551.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5286111 + ... + 5315361.
It is an arithmetic number, because the mean of its divisors is an integer number (1615938984).
Almost surely, 2155051828736 is an apocalyptic number.
155051828736 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 155051828736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (258550237440).
155051828736 is an abundant number, since it is smaller than the sum of its proper divisors (362048646144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155051828736 is a wasteful number, since it uses less digits than its factorization.
155051828736 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29325 (or 29309 counting only the distinct ones).
The product of its (nonzero) digits is 2016000, while the sum is 51.
The spelling of 155051828736 in words is "one hundred fifty-five billion, fifty-one million, eight hundred twenty-eight thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •