Base | Representation |
---|---|
bin | 111001110110010110111101… |
… | …000101111001011110101100 |
3 | 1020100211201012110211021201020 |
4 | 321312112331011321132230 |
5 | 231321441124414400012 |
6 | 2301040501354414140 |
7 | 104406352422621561 |
oct | 7166267505713654 |
9 | 1210751173737636 |
10 | 254424150153132 |
11 | 74081748a34943 |
12 | 24651131131350 |
13 | abc712c56874b |
14 | 46b82a1c94868 |
15 | 1e63251853a8c |
hex | e765bd1797ac |
254424150153132 has 48 divisors (see below), whose sum is σ = 628874794189152. Its totient is φ = 79781565726720.
The previous prime is 254424150152989. The next prime is 254424150153137. The reversal of 254424150153132 is 231351051424452.
It is a super-2 number, since 2×2544241501531322 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (254424150153137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 294688969 + ... + 295551072.
It is an arithmetic number, because the mean of its divisors is an integer number (13101558212274).
Almost surely, 2254424150153132 is an apocalyptic number.
It is an amenable number.
254424150153132 is an abundant number, since it is smaller than the sum of its proper divisors (374450644036020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
254424150153132 is a wasteful number, since it uses less digits than its factorization.
254424150153132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 590242178 (or 590242176 counting only the distinct ones).
The product of its (nonzero) digits is 576000, while the sum is 42.
The spelling of 254424150153132 in words is "two hundred fifty-four trillion, four hundred twenty-four billion, one hundred fifty million, one hundred fifty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •