Base | Representation |
---|---|
bin | 100000000110011… |
… | …1101101010101101 |
3 | 2210001211101111022 |
4 | 1000030331222231 |
5 | 4201221441031 |
6 | 254514503525 |
7 | 35456353160 |
oct | 10014755255 |
9 | 2701741438 |
10 | 1077140141 |
11 | 503021370 |
12 | 260894ba5 |
13 | 14220893c |
14 | a30abad7 |
15 | 6486c97b |
hex | 4033daad |
1077140141 has 16 divisors (see below), whose sum is σ = 1349904768. Its totient is φ = 834969600.
The previous prime is 1077140137. The next prime is 1077140143. The reversal of 1077140141 is 1410417701.
It is a cyclic number.
It is not a de Polignac number, because 1077140141 - 22 = 1077140137 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1077140141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1077140143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21380 + ... + 51101.
It is an arithmetic number, because the mean of its divisors is an integer number (84369048).
Almost surely, 21077140141 is an apocalyptic number.
1077140141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1077140141 is a deficient number, since it is larger than the sum of its proper divisors (272764627).
1077140141 is a wasteful number, since it uses less digits than its factorization.
1077140141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72692.
The product of its (nonzero) digits is 784, while the sum is 26.
The square root of 1077140141 is about 32819.8132383474. The cubic root of 1077140141 is about 1025.0791581936.
Adding to 1077140141 its reverse (1410417701), we get a palindrome (2487557842).
The spelling of 1077140141 in words is "one billion, seventy-seven million, one hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •