Base | Representation |
---|---|
bin | 10000000100101011010… |
… | …011011001111001000001 |
3 | 10220120222210220012211210 |
4 | 100010223103121321001 |
5 | 121044040433232040 |
6 | 2203225425400333 |
7 | 142541234313534 |
oct | 20045323317101 |
9 | 3816883805753 |
10 | 1104533102145 |
11 | 396480160800 |
12 | 15a095a990a9 |
13 | 80206ca1a35 |
14 | 3b66154ca1b |
15 | 1dae892c480 |
hex | 1012b4d9e41 |
1104533102145 has 24 divisors (see below), whose sum is σ = 1942517723328. Its totient is φ = 535531200160.
The previous prime is 1104533102131. The next prime is 1104533102149. The reversal of 1104533102145 is 5412013354011.
It is not a de Polignac number, because 1104533102145 - 26 = 1104533102081 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1104533102149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 304277277 + ... + 304280906.
It is an arithmetic number, because the mean of its divisors is an integer number (80938238472).
Almost surely, 21104533102145 is an apocalyptic number.
1104533102145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1104533102145 is a deficient number, since it is larger than the sum of its proper divisors (837984621183).
1104533102145 is a wasteful number, since it uses less digits than its factorization.
1104533102145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 608558213 (or 608558202 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 1104533102145 its reverse (5412013354011), we get a palindrome (6516546456156).
The spelling of 1104533102145 in words is "one trillion, one hundred four billion, five hundred thirty-three million, one hundred two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •