Base | Representation |
---|---|
bin | 111111110101110… |
… | …011110010000101 |
3 | 2202122102000021220 |
4 | 333311303302011 |
5 | 4143143222331 |
6 | 254140430553 |
7 | 35353643025 |
oct | 7765636205 |
9 | 2678360256 |
10 | 1071070341 |
11 | 4aa656000 |
12 | 25a848459 |
13 | 140b91c43 |
14 | a236ba85 |
15 | 6406e296 |
hex | 3fd73c85 |
1071070341 has 16 divisors (see below), whose sum is σ = 1570801728. Its totient is φ = 649131120.
The previous prime is 1071070333. The next prime is 1071070361. The reversal of 1071070341 is 1430701701.
It is not a de Polignac number, because 1071070341 - 23 = 1071070333 is a prime.
It is a super-2 number, since 2×10710703412 = 2294383350739712562, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1071070361) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 130126 + ... + 138111.
It is an arithmetic number, because the mean of its divisors is an integer number (98175108).
Almost surely, 21071070341 is an apocalyptic number.
1071070341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1071070341 is a deficient number, since it is larger than the sum of its proper divisors (499731387).
1071070341 is an equidigital number, since it uses as much as digits as its factorization.
1071070341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268273 (or 268251 counting only the distinct ones).
The product of its (nonzero) digits is 588, while the sum is 24.
The square root of 1071070341 is about 32727.2110177449. The cubic root of 1071070341 is about 1023.1500531424.
The spelling of 1071070341 in words is "one billion, seventy-one million, seventy thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •