Base | Representation |
---|---|
bin | 100100011110100… |
… | …1100001000010101 |
3 | 10011022011122101010 |
4 | 1020331030020111 |
5 | 10001321000041 |
6 | 321242322433 |
7 | 42221554116 |
oct | 11075141025 |
9 | 3138148333 |
10 | 1224000021 |
11 | 578a09372 |
12 | 2a1ab9419 |
13 | 16677848a |
14 | b87ba20d |
15 | 726cba16 |
hex | 48f4c215 |
1224000021 has 8 divisors (see below), whose sum is σ = 1638829440. Its totient is φ = 812585312.
The previous prime is 1223999971. The next prime is 1224000047. The reversal of 1224000021 is 1200004221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1224000021 - 29 = 1223999509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1223999970 and 1224000006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1224000091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 852840 + ... + 854273.
It is an arithmetic number, because the mean of its divisors is an integer number (204853680).
Almost surely, 21224000021 is an apocalyptic number.
It is an amenable number.
1224000021 is a deficient number, since it is larger than the sum of its proper divisors (414829419).
1224000021 is a wasteful number, since it uses less digits than its factorization.
1224000021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1707355.
The product of its (nonzero) digits is 32, while the sum is 12.
The square root of 1224000021 is about 34985.7116691943. The cubic root of 1224000021 is about 1069.6962543654.
Adding to 1224000021 its reverse (1200004221), we get a palindrome (2424004242).
The spelling of 1224000021 in words is "one billion, two hundred twenty-four million, twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •