Base | Representation |
---|---|
bin | 111110010000001… |
… | …001101000000001 |
3 | 2200210021002102202 |
4 | 332100021220001 |
5 | 4114332433441 |
6 | 251345322545 |
7 | 34611301352 |
oct | 7620115001 |
9 | 2623232382 |
10 | 1044421121 |
11 | 496604057 |
12 | 251936455 |
13 | 1384c1183 |
14 | 9c9d1d29 |
15 | 61a5819b |
hex | 3e409a01 |
1044421121 has 8 divisors (see below), whose sum is σ = 1057994784. Its totient is φ = 1030871200.
The previous prime is 1044421117. The next prime is 1044421177. The reversal of 1044421121 is 1211244401.
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 1044421121 - 22 = 1044421117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1044421093 and 1044421102.
It is not an unprimeable number, because it can be changed into a prime (1044421111) 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 7 ways as a sum of consecutive naturals, for example, 93221 + ... + 103821.
It is an arithmetic number, because the mean of its divisors is an integer number (132249348).
Almost surely, 21044421121 is an apocalyptic number.
It is an amenable number.
1044421121 is a deficient number, since it is larger than the sum of its proper divisors (13573663).
1044421121 is a wasteful number, since it uses less digits than its factorization.
1044421121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11871.
The product of its (nonzero) digits is 256, while the sum is 20.
The square root of 1044421121 is about 32317.5048696523. The cubic root of 1044421121 is about 1014.5930474035.
Adding to 1044421121 its reverse (1211244401), we get a palindrome (2255665522).
The spelling of 1044421121 in words is "one billion, forty-four million, four hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •