Base | Representation |
---|---|
bin | 111111111100001… |
… | …000100000110001 |
3 | 2202202112020022212 |
4 | 333330020200301 |
5 | 4144104244423 |
6 | 254240141505 |
7 | 35404016132 |
oct | 7774104061 |
9 | 2682466285 |
10 | 1072728113 |
11 | 500588566 |
12 | 25b307895 |
13 | 141322682 |
14 | a267dc89 |
15 | 6429a578 |
hex | 3ff08831 |
1072728113 has 2 divisors, whose sum is σ = 1072728114. Its totient is φ = 1072728112.
The previous prime is 1072728103. The next prime is 1072728121. The reversal of 1072728113 is 3118272701.
1072728113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1013021584 + 59706529 = 31828^2 + 7727^2 .
It is an emirp because it is prime and its reverse (3118272701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1072728113 - 28 = 1072727857 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1072728113.
It is not a weakly prime, because it can be changed into another prime (1072728103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 536364056 + 536364057.
It is an arithmetic number, because the mean of its divisors is an integer number (536364057).
Almost surely, 21072728113 is an apocalyptic number.
It is an amenable number.
1072728113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1072728113 is an equidigital number, since it uses as much as digits as its factorization.
1072728113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4704, while the sum is 32.
The square root of 1072728113 is about 32752.5283451522. The cubic root of 1072728113 is about 1023.6776484872.
The spelling of 1072728113 in words is "one billion, seventy-two million, seven hundred twenty-eight thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.938 sec. • engine limits •