Base | Representation |
---|---|
bin | 11111001010100010110… |
… | …11110101110101100001 |
3 | 10210100221210210010001001 |
4 | 33211101123311311201 |
5 | 120021011124001401 |
6 | 2135531425112001 |
7 | 140235514152424 |
oct | 17452133656541 |
9 | 3710853703031 |
10 | 1070813109601 |
11 | 3831470a2274 |
12 | 153645188601 |
13 | 79c92006121 |
14 | 39b8303b9bb |
15 | 1ccc343d601 |
hex | f9516f5d61 |
1070813109601 has 9 divisors (see below), whose sum is σ = 1089332210001. Its totient is φ = 1052603716404.
The previous prime is 1070813109581. The next prime is 1070813109631. The reversal of 1070813109601 is 1069013180701.
The square root of 1070813109601 is 1034801.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 1070813109601 - 227 = 1070678891873 is a prime.
It is a super-2 number, since 2×10708131096012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1070813109631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 61044490 + ... + 61062028.
Almost surely, 21070813109601 is an apocalyptic number.
1070813109601 is the 1034801-st square number.
1070813109601 is the 517401-st centered octagonal number.
It is an amenable number.
1070813109601 is a deficient number, since it is larger than the sum of its proper divisors (18519100400).
1070813109601 is an frugal number, since it uses more digits than its factorization.
1070813109601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35196 (or 17598 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 37.
The spelling of 1070813109601 in words is "one trillion, seventy billion, eight hundred thirteen million, one hundred nine thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •