Base | Representation |
---|---|
bin | 100100011110110… |
… | …0101100010101111 |
3 | 10011022100221011022 |
4 | 1020331211202233 |
5 | 10001332312421 |
6 | 321244444355 |
7 | 42222466436 |
oct | 11075454257 |
9 | 3138327138 |
10 | 1224104111 |
11 | 578a7a59a |
12 | 2a1b496bb |
13 | 1667b3979 |
14 | b880611d |
15 | 726ec7ab |
hex | 48f658af |
1224104111 has 4 divisors (see below), whose sum is σ = 1224224232. Its totient is φ = 1223983992.
The previous prime is 1224104071. The next prime is 1224104129. The reversal of 1224104111 is 1114014221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1224104111 - 214 = 1224087727 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1224104111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1224104191) 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 3 ways as a sum of consecutive naturals, for example, 43196 + ... + 65681.
It is an arithmetic number, because the mean of its divisors is an integer number (306056058).
Almost surely, 21224104111 is an apocalyptic number.
1224104111 is a deficient number, since it is larger than the sum of its proper divisors (120121).
1224104111 is a wasteful number, since it uses less digits than its factorization.
1224104111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120120.
The product of its (nonzero) digits is 64, while the sum is 17.
The square root of 1224104111 is about 34987.1992448667. The cubic root of 1224104111 is about 1069.7265761315.
Adding to 1224104111 its reverse (1114014221), we get a palindrome (2338118332).
The spelling of 1224104111 in words is "one billion, two hundred twenty-four million, one hundred four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •