Base | Representation |
---|---|
bin | 111110010000000… |
… | …111000000110110 |
3 | 2200210020112202111 |
4 | 332100013000312 |
5 | 4114332113142 |
6 | 251345201234 |
7 | 34611225226 |
oct | 7620070066 |
9 | 2623215674 |
10 | 1044410422 |
11 | 4965a7010 |
12 | 25193021a |
13 | 1384b9343 |
14 | 9c9cc086 |
15 | 61a54e17 |
hex | 3e407036 |
1044410422 has 8 divisors (see below), whose sum is σ = 1709035272. Its totient is φ = 474732000.
The previous prime is 1044410417. The next prime is 1044410431. The reversal of 1044410422 is 2240144401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 47473201 = 1044410422 / (1 + 0 + 4 + 4 + 4 + 1 + 0 + 4 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 1044410393 and 1044410402.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 23736579 + ... + 23736622.
It is an arithmetic number, because the mean of its divisors is an integer number (213629409).
Almost surely, 21044410422 is an apocalyptic number.
1044410422 is a deficient number, since it is larger than the sum of its proper divisors (664624850).
1044410422 is a wasteful number, since it uses less digits than its factorization.
1044410422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47473214.
The product of its (nonzero) digits is 1024, while the sum is 22.
The square root of 1044410422 is about 32317.3393397414. The cubic root of 1044410422 is about 1014.5895829107.
Adding to 1044410422 its reverse (2240144401), we get a palindrome (3284554823).
The spelling of 1044410422 in words is "one billion, forty-four million, four hundred ten thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •