Base | Representation |
---|---|
bin | 10000000100101010100… |
… | …101010101011010000001 |
3 | 10220120221222011122022210 |
4 | 100010222211111122001 |
5 | 121044024340301103 |
6 | 2203224314452333 |
7 | 142541026543620 |
oct | 20045245253201 |
9 | 3816858148283 |
10 | 1104521025153 |
11 | 396474362117 |
12 | 15a091a340a9 |
13 | 802046339a0 |
14 | 3b65dac76b7 |
15 | 1dae7843e03 |
hex | 1012a955681 |
1104521025153 has 64 divisors (see below), whose sum is σ = 1921983178752. Its totient is φ = 547529241600.
The previous prime is 1104521025151. The next prime is 1104521025191. The reversal of 1104521025153 is 3515201254011.
It is not a de Polignac number, because 1104521025153 - 21 = 1104521025151 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1104521025153.
It is not an unprimeable number, because it can be changed into a prime (1104521025151) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2995578 + ... + 3344028.
It is an arithmetic number, because the mean of its divisors is an integer number (30030987168).
Almost surely, 21104521025153 is an apocalyptic number.
1104521025153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1104521025153 is a deficient number, since it is larger than the sum of its proper divisors (817462153599).
1104521025153 is a wasteful number, since it uses less digits than its factorization.
1104521025153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349174.
The product of its (nonzero) digits is 6000, while the sum is 30.
Adding to 1104521025153 its reverse (3515201254011), we get a palindrome (4619722279164).
The spelling of 1104521025153 in words is "one trillion, one hundred four billion, five hundred twenty-one million, twenty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •