Base | Representation |
---|---|
bin | 1000111100010111011… |
… | …1101100001100100000 |
3 | 112200120200110211121010 |
4 | 2033011313230030200 |
5 | 10004130223101411 |
6 | 154325522500520 |
7 | 14046300522144 |
oct | 2170567541440 |
9 | 480520424533 |
10 | 153643565856 |
11 | 5a183873100 |
12 | 2593ab04740 |
13 | 116473a41a1 |
14 | 7617641224 |
15 | 3ee38e97a6 |
hex | 23c5dec320 |
153643565856 has 144 divisors (see below), whose sum is σ = 448926710400. Its totient is φ = 45969031680.
The previous prime is 153643565827. The next prime is 153643565863. The reversal of 153643565856 is 658565346351.
It is a junction number, because it is equal to n+sod(n) for n = 153643565796 and 153643565805.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 833950 + ... + 1001378.
It is an arithmetic number, because the mean of its divisors is an integer number (3117546600).
Almost surely, 2153643565856 is an apocalyptic number.
153643565856 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 153643565856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (224463355200).
153643565856 is an abundant number, since it is smaller than the sum of its proper divisors (295283144544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153643565856 is a wasteful number, since it uses less digits than its factorization.
153643565856 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167543 (or 167524 counting only the distinct ones).
The product of its digits is 38880000, while the sum is 57.
The spelling of 153643565856 in words is "one hundred fifty-three billion, six hundred forty-three million, five hundred sixty-five thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •