Base | Representation |
---|---|
bin | 11111110011010111000… |
… | …00111010100000100000 |
3 | 10212110111220210001011122 |
4 | 33321223200322200200 |
5 | 120400400210433202 |
6 | 2153554031231412 |
7 | 141642520233533 |
oct | 17715340724040 |
9 | 3773456701148 |
10 | 1092725483552 |
11 | 39147105912a |
12 | 15793b678568 |
13 | 7c074957881 |
14 | 3ac612cca1a |
15 | 1d65700d9a2 |
hex | fe6b83a820 |
1092725483552 has 24 divisors (see below), whose sum is σ = 2225486169900. Its totient is φ = 527522646784.
The previous prime is 1092725483497. The next prime is 1092725483569. The reversal of 1092725483552 is 2553845272901.
It can be written as a sum of positive squares in 2 ways, for example, as 961568515216 + 131156968336 = 980596^2 + 362156^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1092725483494 and 1092725483503.
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 3 ways as a sum of consecutive naturals, for example, 588752027 + ... + 588753882.
Almost surely, 21092725483552 is an apocalyptic number.
It is an amenable number.
1092725483552 is an abundant number, since it is smaller than the sum of its proper divisors (1132760686348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1092725483552 is a wasteful number, since it uses less digits than its factorization.
1092725483552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1177505948 (or 1177505940 counting only the distinct ones).
The product of its (nonzero) digits is 6048000, while the sum is 53.
The spelling of 1092725483552 in words is "one trillion, ninety-two billion, seven hundred twenty-five million, four hundred eighty-three thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •