Base | Representation |
---|---|
bin | 111110010000001… |
… | …110111110101010 |
3 | 2200210022012111221 |
4 | 332100032332222 |
5 | 4114334134200 |
6 | 251350012254 |
7 | 34611422320 |
oct | 7620167652 |
9 | 2623265457 |
10 | 1044443050 |
11 | 496619582 |
12 | 25194708a |
13 | 1384cb151 |
14 | 9c9d9d10 |
15 | 61a5e91a |
hex | 3e40efaa |
1044443050 has 72 divisors (see below), whose sum is σ = 2254436064. Its totient is φ = 352623840.
The previous prime is 1044443021. The next prime is 1044443063. The reversal of 1044443050 is 503444401.
It is a super-2 number, since 2×10444430502 = 2181722569386605000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 6254067 + ... + 6254233.
It is an arithmetic number, because the mean of its divisors is an integer number (31311612).
Almost surely, 21044443050 is an apocalyptic number.
1044443050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1044443050 is an abundant number, since it is smaller than the sum of its proper divisors (1209993014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1044443050 is a wasteful number, since it uses less digits than its factorization.
1044443050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460 (or 288 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 25.
The square root of 1044443050 is about 32317.8441422073. The cubic root of 1044443050 is about 1014.6001482605.
Adding to 1044443050 its reverse (503444401), we get a palindrome (1547887451).
The spelling of 1044443050 in words is "one billion, forty-four million, four hundred forty-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •