Base | Representation |
---|---|
bin | 1000111011111010010… |
… | …1110010101111010000 |
3 | 112200021011122212120110 |
4 | 2032332211302233100 |
5 | 10003402441333202 |
6 | 154305441041320 |
7 | 14043255440244 |
oct | 2167645625720 |
9 | 480234585513 |
10 | 153521433552 |
11 | 5a120935313 |
12 | 25906026240 |
13 | 11627cb1856 |
14 | 760532c424 |
15 | 3ed7d2226c |
hex | 23be972bd0 |
153521433552 has 40 divisors (see below), whose sum is σ = 402182919360. Its totient is φ = 50453052160.
The previous prime is 153521433509. The next prime is 153521433553. The reversal of 153521433552 is 255334125351.
It is a super-2 number, since 2×1535214335522 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 153521433552.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153521433553) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22520277 + ... + 22527092.
It is an arithmetic number, because the mean of its divisors is an integer number (10054572984).
Almost surely, 2153521433552 is an apocalyptic number.
153521433552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
153521433552 is an abundant number, since it is smaller than the sum of its proper divisors (248661485808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153521433552 is a wasteful number, since it uses less digits than its factorization.
153521433552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45047451 (or 45047445 counting only the distinct ones).
The product of its digits is 270000, while the sum is 39.
The spelling of 153521433552 in words is "one hundred fifty-three billion, five hundred twenty-one million, four hundred thirty-three thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •