Base | Representation |
---|---|
bin | 111110010000000… |
… | …111101111101111 |
3 | 2200210020200212122 |
4 | 332100013233233 |
5 | 4114332212143 |
6 | 251345223155 |
7 | 34611240044 |
oct | 7620075757 |
9 | 2623220778 |
10 | 1044413423 |
11 | 4965a9299 |
12 | 251931abb |
13 | 1384ba811 |
14 | 9c9cd1cb |
15 | 61a55c68 |
hex | 3e407bef |
1044413423 has 4 divisors (see below), whose sum is σ = 1046837088. Its totient is φ = 1041989760.
The previous prime is 1044413407. The next prime is 1044413437. The reversal of 1044413423 is 3243144401.
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 1044413423 - 24 = 1044413407 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1044413392 and 1044413401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1044413473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1211186 + ... + 1212047.
It is an arithmetic number, because the mean of its divisors is an integer number (261709272).
Almost surely, 21044413423 is an apocalyptic number.
1044413423 is a deficient number, since it is larger than the sum of its proper divisors (2423665).
1044413423 is an equidigital number, since it uses as much as digits as its factorization.
1044413423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2423664.
The product of its (nonzero) digits is 4608, while the sum is 26.
The square root of 1044413423 is about 32317.3857698917. The cubic root of 1044413423 is about 1014.5905546808.
Adding to 1044413423 its reverse (3243144401), we get a palindrome (4287557824).
The spelling of 1044413423 in words is "one billion, forty-four million, four hundred thirteen thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •