Base | Representation |
---|---|
bin | 10000000100010010111… |
… | …011111101011101111110 |
3 | 10220112221022200002011020 |
4 | 100010102323331131332 |
5 | 121042221310200410 |
6 | 2203121103405010 |
7 | 142525141504134 |
oct | 20042273753576 |
9 | 3815838602136 |
10 | 1104124303230 |
11 | 396290426063 |
12 | 159ba0bb3766 |
13 | 8017039c4a0 |
14 | 3b623137754 |
15 | 1dac2acba70 |
hex | 10112efd77e |
1104124303230 has 64 divisors (see below), whose sum is σ = 2854057405248. Its totient is φ = 271753896960.
The previous prime is 1104124303067. The next prime is 1104124303241. The reversal of 1104124303230 is 323034214011.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 1104124303230.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 3418272 + ... + 3727308.
It is an arithmetic number, because the mean of its divisors is an integer number (44594646957).
Almost surely, 21104124303230 is an apocalyptic number.
1104124303230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1104124303230 is an abundant number, since it is smaller than the sum of its proper divisors (1749933102018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1104124303230 is a wasteful number, since it uses less digits than its factorization.
1104124303230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318221.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 1104124303230 its reverse (323034214011), we get a palindrome (1427158517241).
The spelling of 1104124303230 in words is "one trillion, one hundred four billion, one hundred twenty-four million, three hundred three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •