Base | Representation |
---|---|
bin | 11110010001011101011101… |
… | …101000101000011110010011 |
3 | 122110102011212110220212101100 |
4 | 132101131131220220132103 |
5 | 114422341301102010311 |
6 | 1151100130151235443 |
7 | 40021065410306313 |
oct | 3621353550503623 |
9 | 573364773825340 |
10 | 133141262141331 |
11 | 3947198a547554 |
12 | 12b23803378b83 |
13 | 593a2232b8062 |
14 | 24c410018b443 |
15 | 105d49a721a56 |
hex | 79175da28793 |
133141262141331 has 12 divisors (see below), whose sum is σ = 194219266887360. Its totient is φ = 87882021214800.
The previous prime is 133141262141269. The next prime is 133141262141341.
133141262141331 is a `hidden beast` number, since 1 + 3 + 3 + 1 + 4 + 12 + 621 + 4 + 13 + 3 + 1 = 666.
133141262141331 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 133141262141331 - 29 = 133141262140819 is a prime.
It is a super-2 number, since 2×1331412621413312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (133141262141341) 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, 73235016771 + ... + 73235018588.
It is an arithmetic number, because the mean of its divisors is an integer number (16184938907280).
Almost surely, 2133141262141331 is an apocalyptic number.
133141262141331 is a deficient number, since it is larger than the sum of its proper divisors (61078004746029).
133141262141331 is a wasteful number, since it uses less digits than its factorization.
133141262141331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146470035466 (or 146470035463 counting only the distinct ones).
The product of its digits is 31104, while the sum is 36.
The spelling of 133141262141331 in words is "one hundred thirty-three trillion, one hundred forty-one billion, two hundred sixty-two million, one hundred forty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •