Base | Representation |
---|---|
bin | 100001100000010… |
… | …0100110001100110 |
3 | 2220100102111112201 |
4 | 1003000210301212 |
5 | 4300300132402 |
6 | 303320005114 |
7 | 36600514201 |
oct | 10300446146 |
9 | 2810374481 |
10 | 1124224102 |
11 | 527660231 |
12 | 27460079a |
13 | 14bbb2981 |
14 | a9446938 |
15 | 68a6d687 |
hex | 43024c66 |
1124224102 has 8 divisors (see below), whose sum is σ = 1686742200. Its totient is φ = 561976704.
The previous prime is 1124224099. The next prime is 1124224103. The reversal of 1124224102 is 2014224211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1124224102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1124224103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56952 + ... + 74107.
It is an arithmetic number, because the mean of its divisors is an integer number (210842775).
Almost surely, 21124224102 is an apocalyptic number.
1124224102 is a deficient number, since it is larger than the sum of its proper divisors (562518098).
1124224102 is a wasteful number, since it uses less digits than its factorization.
1124224102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135350.
The product of its (nonzero) digits is 256, while the sum is 19.
The square root of 1124224102 is about 33529.4512630314. The cubic root of 1124224102 is about 1039.8027553694.
Adding to 1124224102 its reverse (2014224211), we get a palindrome (3138448313).
It can be divided in two parts, 11242 and 24102, that added together give a square (35344 = 1882).
The spelling of 1124224102 in words is "one billion, one hundred twenty-four million, two hundred twenty-four thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •