Base | Representation |
---|---|
bin | 11111000010001010101… |
… | …11001101100101011110 |
3 | 10202221100100221001211110 |
4 | 33201011113031211132 |
5 | 114432303243233040 |
6 | 2133505244002450 |
7 | 140016203033232 |
oct | 17410527154536 |
9 | 3687310831743 |
10 | 1066315602270 |
11 | 3812493a4466 |
12 | 1527aab30426 |
13 | 797262c3099 |
14 | 398779c05c2 |
15 | 1cb0d693980 |
hex | f8455cd95e |
1066315602270 has 32 divisors (see below), whose sum is σ = 2563291831680. Its totient is φ = 283891451040.
The previous prime is 1066315602263. The next prime is 1066315602277. The reversal of 1066315602270 is 722065136601.
It is an interprime number because it is at equal distance from previous prime (1066315602263) and next prime (1066315602277).
It is a super-2 number, since 2×10663156022702 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1066315602277) 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, 28692136 + ... + 28729275.
It is an arithmetic number, because the mean of its divisors is an integer number (80102869740).
Almost surely, 21066315602270 is an apocalyptic number.
1066315602270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1066315602270 is an abundant number, since it is smaller than the sum of its proper divisors (1496976229410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1066315602270 is a wasteful number, since it uses less digits than its factorization.
1066315602270 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57422040.
The product of its (nonzero) digits is 90720, while the sum is 39.
The spelling of 1066315602270 in words is "one trillion, sixty-six billion, three hundred fifteen million, six hundred two thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •