Base | Representation |
---|---|
bin | 11110011001000001110011… |
… | …100011111100101111101111 |
3 | 122112020220020021111222112022 |
4 | 132121001303203330233233 |
5 | 120004401341142231330 |
6 | 1152135055130500355 |
7 | 40103466065164322 |
oct | 3631016343745757 |
9 | 575226207458468 |
10 | 133661321055215 |
11 | 396524a2212928 |
12 | 12ba8561b946bb |
13 | 597729309a235 |
14 | 25013574307b9 |
15 | 106bc8735bae5 |
hex | 7990738fcbef |
133661321055215 has 16 divisors (see below), whose sum is σ = 162330049317600. Its totient is φ = 105645478955520.
The previous prime is 133661321055211. The next prime is 133661321055217. The reversal of 133661321055215 is 512550123166331.
It is not a de Polignac number, because 133661321055215 - 22 = 133661321055211 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133661321055211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 462239390 + ... + 462528459.
It is an arithmetic number, because the mean of its divisors is an integer number (10145628082350).
Almost surely, 2133661321055215 is an apocalyptic number.
133661321055215 is a deficient number, since it is larger than the sum of its proper divisors (28668728262385).
133661321055215 is a wasteful number, since it uses less digits than its factorization.
133661321055215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 924768202.
The product of its (nonzero) digits is 486000, while the sum is 44.
The spelling of 133661321055215 in words is "one hundred thirty-three trillion, six hundred sixty-one billion, three hundred twenty-one million, fifty-five thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •