Base | Representation |
---|---|
bin | 111110001110101… |
… | …011100110000000 |
3 | 2200202112112002211 |
4 | 332032223212000 |
5 | 4114233122333 |
6 | 251333151504 |
7 | 34605105433 |
oct | 7616534600 |
9 | 2622475084 |
10 | 1044035968 |
11 | 496370748 |
12 | 25178b594 |
13 | 1383b7a81 |
14 | 9c93181a |
15 | 619cdecd |
hex | 3e3ab980 |
1044035968 has 32 divisors (see below), whose sum is σ = 2082636000. Its totient is φ = 521335296.
The previous prime is 1044035947. The next prime is 1044035969. The reversal of 1044035968 is 8695304401.
1044035968 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×10440359682 = 2180022204955394048, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1044035968.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1044035969) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 101193 + ... + 111031.
It is an arithmetic number, because the mean of its divisors is an integer number (65082375).
Almost surely, 21044035968 is an apocalyptic number.
It is an amenable number.
1044035968 is a deficient number, since it is larger than the sum of its proper divisors (1038600032).
1044035968 is an frugal number, since it uses more digits than its factorization.
1044035968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10682 (or 10670 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 40.
The square root of 1044035968 is about 32311.5454288401. The cubic root of 1044035968 is about 1014.4683143198.
The spelling of 1044035968 in words is "one billion, forty-four million, thirty-five thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •