Base | Representation |
---|---|
bin | 1000110101100101000… |
… | …0110110000100011000 |
3 | 112111212200211102102110 |
4 | 2031121100312010120 |
5 | 4441412242141402 |
6 | 153425032232320 |
7 | 13653163655505 |
oct | 2153120660430 |
9 | 474780742373 |
10 | 151821443352 |
11 | 59429279537 |
12 | 2551083b6a0 |
13 | 11416a398a7 |
14 | 74c364a4ac |
15 | 3e3897156c |
hex | 2359436118 |
151821443352 has 32 divisors (see below), whose sum is σ = 381674030400. Its totient is φ = 50324424864.
The previous prime is 151821443341. The next prime is 151821443359. The reversal of 151821443352 is 253344128151.
It is a super-2 number, since 2×1518214433522 (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 151821443352.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151821443359) 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, 17665798 + ... + 17674389.
It is an arithmetic number, because the mean of its divisors is an integer number (11927313450).
Almost surely, 2151821443352 is an apocalyptic number.
151821443352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
151821443352 is an abundant number, since it is smaller than the sum of its proper divisors (229852587048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151821443352 is a wasteful number, since it uses less digits than its factorization.
151821443352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35340375 (or 35340371 counting only the distinct ones).
The product of its digits is 115200, while the sum is 39.
The spelling of 151821443352 in words is "one hundred fifty-one billion, eight hundred twenty-one million, four hundred forty-three thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •