Base | Representation |
---|---|
bin | 10000100111101010100… |
… | …111010111110101011001 |
3 | 11001011222002101112212210 |
4 | 100213222213113311121 |
5 | 122203011221220400 |
6 | 2232401420425333 |
7 | 145341236161446 |
oct | 20475247276531 |
9 | 4034862345783 |
10 | 1142102523225 |
11 | 4003aa110934 |
12 | 16541b9a8249 |
13 | 83913620001 |
14 | 3d3c6dba9cd |
15 | 1ea96d4c950 |
hex | 109ea9d7d59 |
1142102523225 has 12 divisors (see below), whose sum is σ = 1888276171856. Its totient is φ = 609121345680.
The previous prime is 1142102523193. The next prime is 1142102523251. The reversal of 1142102523225 is 5223252012411.
It is not a de Polignac number, because 1142102523225 - 25 = 1142102523193 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1142102523192 and 1142102523201.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7614016747 + ... + 7614016896.
Almost surely, 21142102523225 is an apocalyptic number.
1142102523225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1142102523225 is a deficient number, since it is larger than the sum of its proper divisors (746173648631).
1142102523225 is a wasteful number, since it uses less digits than its factorization.
1142102523225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15228033656 (or 15228033651 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 1142102523225 its reverse (5223252012411), we get a palindrome (6365354535636).
The spelling of 1142102523225 in words is "one trillion, one hundred forty-two billion, one hundred two million, five hundred twenty-three thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •