Base | Representation |
---|---|
bin | 111111111010111… |
… | …011000110010100 |
3 | 2202201221010100222 |
4 | 333322323012110 |
5 | 4144014123103 |
6 | 254225253512 |
7 | 35401225523 |
oct | 7772730624 |
9 | 2681833328 |
10 | 1072411028 |
11 | 500391307 |
12 | 25b194298 |
13 | 141241250 |
14 | a25da4ba |
15 | 64236638 |
hex | 3febb194 |
1072411028 has 12 divisors (see below), whose sum is σ = 2021082420. Its totient is φ = 494958912.
The previous prime is 1072411007. The next prime is 1072411033. The reversal of 1072411028 is 8201142701.
It can be written as a sum of positive squares in 2 ways, for example, as 233845264 + 838565764 = 15292^2 + 28958^2 .
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a junction number, because it is equal to n+sod(n) for n = 1072410988 and 1072411006.
It is a congruent number.
It is an unprimeable number.
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, 10311593 + ... + 10311696.
It is an arithmetic number, because the mean of its divisors is an integer number (168423535).
Almost surely, 21072411028 is an apocalyptic number.
It is an amenable number.
1072411028 is a deficient number, since it is larger than the sum of its proper divisors (948671392).
1072411028 is a wasteful number, since it uses less digits than its factorization.
1072411028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20623306 (or 20623304 counting only the distinct ones).
The product of its (nonzero) digits is 896, while the sum is 26.
The square root of 1072411028 is about 32747.6873687288. The cubic root of 1072411028 is about 1023.5767764488.
Adding to 1072411028 its reverse (8201142701), we get a palindrome (9273553729).
The spelling of 1072411028 in words is "one billion, seventy-two million, four hundred eleven thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •