Base | Representation |
---|---|
bin | 10000100111110110000… |
… | …101011110010101000100 |
3 | 11001012110111111112100021 |
4 | 100213312011132111010 |
5 | 122203410002313044 |
6 | 2232432453224524 |
7 | 145346063662051 |
oct | 20476605362504 |
9 | 4035414445307 |
10 | 1142294963524 |
11 | 400498800100 |
12 | 165474332144 |
13 | 8394445b400 |
14 | 3d404792028 |
15 | 1eaa8bb1e84 |
hex | 109f615e544 |
1142294963524 has 243 divisors, whose sum is σ = 2469781697733. Its totient is φ = 461713824000.
The previous prime is 1142294963501. The next prime is 1142294963569. The reversal of 1142294963524 is 4253694922411.
The square root of 1142294963524 is 1068782.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 20644517124 + 1121650446400 = 143682^2 + 1059080^2 .
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 11309851074 + ... + 11309851174.
Almost surely, 21142294963524 is an apocalyptic number.
1142294963524 is the 1068782-nd square number.
It is an amenable number.
1142294963524 is an abundant number, since it is smaller than the sum of its proper divisors (1327486734209).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1142294963524 is a wasteful number, since it uses less digits than its factorization.
1142294963524 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328 (or 164 counting only the distinct ones).
The product of its digits is 3732480, while the sum is 52.
The spelling of 1142294963524 in words is "one trillion, one hundred forty-two billion, two hundred ninety-four million, nine hundred sixty-three thousand, five hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •