Base | Representation |
---|---|
bin | 111110001111011… |
… | …101011101011111 |
3 | 2200202220220021211 |
4 | 332033131131133 |
5 | 4114311141343 |
6 | 251341405251 |
7 | 34606616065 |
oct | 7617353537 |
9 | 2622826254 |
10 | 1044240223 |
11 | 4964a0154 |
12 | 251869827 |
13 | 138459a30 |
14 | 9c986035 |
15 | 61a1e79d |
hex | 3e3dd75f |
1044240223 has 8 divisors (see below), whose sum is σ = 1130782016. Its totient is φ = 958586400.
The previous prime is 1044240199. The next prime is 1044240259. The reversal of 1044240223 is 3220424401.
It is a happy number.
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 1044240223 - 25 = 1044240191 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1044240194 and 1044240203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1044246223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 219543 + ... + 224248.
It is an arithmetic number, because the mean of its divisors is an integer number (141347752).
Almost surely, 21044240223 is an apocalyptic number.
1044240223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1044240223 is a deficient number, since it is larger than the sum of its proper divisors (86541793).
1044240223 is a wasteful number, since it uses less digits than its factorization.
1044240223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 443985.
The product of its (nonzero) digits is 1536, while the sum is 22.
The square root of 1044240223 is about 32314.7059865938. The cubic root of 1044240223 is about 1014.5344668025.
Adding to 1044240223 its reverse (3220424401), we get a palindrome (4264664624).
The spelling of 1044240223 in words is "one billion, forty-four million, two hundred forty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •