Base | Representation |
---|---|
bin | 10011101111000111110… |
… | …010111010100001011101 |
3 | 11210122202120002112102100 |
4 | 103233013302322201131 |
5 | 134210113234224013 |
6 | 2515021010315313 |
7 | 166662360555105 |
oct | 23570762724135 |
9 | 4718676075370 |
10 | 1356266711133 |
11 | 48320a223054 |
12 | 19aa2ab88b39 |
13 | 9ab84276a59 |
14 | 499022b4205 |
15 | 2542da38473 |
hex | 13bc7cba85d |
1356266711133 has 12 divisors (see below), whose sum is σ = 1960948397980. Its totient is φ = 903302508096.
The previous prime is 1356266711123. The next prime is 1356266711147. The reversal of 1356266711133 is 3311176626531.
1356266711133 is a `hidden beast` number, since 1 + 3 + 5 + 626 + 6 + 7 + 1 + 1 + 13 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1090725406884 + 265541304249 = 1044378^2 + 515307^2 .
It is not a de Polignac number, because 1356266711133 - 29 = 1356266710621 is a prime.
It is a super-2 number, since 2×13562667111332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1356266711123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 72931798 + ... + 72950391.
Almost surely, 21356266711133 is an apocalyptic number.
It is an amenable number.
1356266711133 is a deficient number, since it is larger than the sum of its proper divisors (604681686847).
1356266711133 is a wasteful number, since it uses less digits than its factorization.
1356266711133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145883228 (or 145883225 counting only the distinct ones).
The product of its digits is 408240, while the sum is 45.
The spelling of 1356266711133 in words is "one trillion, three hundred fifty-six billion, two hundred sixty-six million, seven hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •