Base | Representation |
---|---|
bin | 10000010111000111011… |
… | …010001101001101101110 |
3 | 10222111002122000102222000 |
4 | 100113013122031031232 |
5 | 121410112443000420 |
6 | 2220302212433130 |
7 | 144141665213244 |
oct | 20270732151556 |
9 | 3874078012860 |
10 | 1124332000110 |
11 | 3a39101148a0 |
12 | 161aa06187a6 |
13 | 82040ac7887 |
14 | 3c5bcc46794 |
15 | 1e3a6bc2690 |
hex | 105c768d36e |
1124332000110 has 128 divisors (see below), whose sum is σ = 3350559582720. Its totient is φ = 265917369600.
The previous prime is 1124332000093. The next prime is 1124332000111. The reversal of 1124332000110 is 110002334211.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1124332000111) 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, 4494852 + ... + 4738391.
It is an arithmetic number, because the mean of its divisors is an integer number (26176246740).
Almost surely, 21124332000110 is an apocalyptic number.
1124332000110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1124332000110 is an abundant number, since it is smaller than the sum of its proper divisors (2226227582610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1124332000110 is a wasteful number, since it uses less digits than its factorization.
1124332000110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9233311 (or 9233305 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1124332000110 its reverse (110002334211), we get a palindrome (1234334334321).
The spelling of 1124332000110 in words is "one trillion, one hundred twenty-four billion, three hundred thirty-two million, one hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •