Base | Representation |
---|---|
bin | 10110011100100000010… |
… | …011100000100011010000 |
3 | 12110110021222000220022011 |
4 | 112130200103200203100 |
5 | 200232401410303430 |
6 | 3140330204152304 |
7 | 216302661152542 |
oct | 26344023404320 |
9 | 5413258026264 |
10 | 1542435244240 |
11 | 545163536480 |
12 | 20ab26538694 |
13 | b25b2b74797 |
14 | 5492342d692 |
15 | 2a1c7a6a22a |
hex | 167204e08d0 |
1542435244240 has 40 divisors (see below), whose sum is σ = 3912176667168. Its totient is φ = 560885543040.
The previous prime is 1542435244237. The next prime is 1542435244241. The reversal of 1542435244240 is 424425342451.
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 1542435244193 and 1542435244202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1542435244241) 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, 876382782 + ... + 876384541.
Almost surely, 21542435244240 is an apocalyptic number.
1542435244240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1542435244240 is an abundant number, since it is smaller than the sum of its proper divisors (2369741422928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1542435244240 is a wasteful number, since it uses less digits than its factorization.
1542435244240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1752767347 (or 1752767341 counting only the distinct ones).
The product of its (nonzero) digits is 614400, while the sum is 40.
The spelling of 1542435244240 in words is "one trillion, five hundred forty-two billion, four hundred thirty-five million, two hundred forty-four thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •