Base | Representation |
---|---|
bin | 11111001001011011101… |
… | …10110110101011000101 |
3 | 10210022102012121112021200 |
4 | 33210231312312223011 |
5 | 120013300322224031 |
6 | 2135352303333113 |
7 | 140214645461610 |
oct | 17445566665305 |
9 | 3708365545250 |
10 | 1070216211141 |
11 | 382970172660 |
12 | 1534b92b1199 |
13 | 79bc845517c |
14 | 39b27a61177 |
15 | 1cc8ad348e6 |
hex | f92ddb6ac5 |
1070216211141 has 96 divisors (see below), whose sum is σ = 2048633503488. Its totient is φ = 521215672320.
The previous prime is 1070216211137. The next prime is 1070216211167. The reversal of 1070216211141 is 1411126120701.
1070216211141 is a `hidden beast` number, since 1 + 0 + 7 + 0 + 21 + 621 + 1 + 14 + 1 = 666.
It is not a de Polignac number, because 1070216211141 - 22 = 1070216211137 is a prime.
It is a super-2 number, since 2×10702162111412 (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 (1070216211541) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2850981 + ... + 3204453.
It is an arithmetic number, because the mean of its divisors is an integer number (21339932328).
Almost surely, 21070216211141 is an apocalyptic number.
1070216211141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1070216211141 is a deficient number, since it is larger than the sum of its proper divisors (978417292347).
1070216211141 is a wasteful number, since it uses less digits than its factorization.
1070216211141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 353771 (or 353768 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 27.
The spelling of 1070216211141 in words is "one trillion, seventy billion, two hundred sixteen million, two hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •