Base | Representation |
---|---|
bin | 11110010111101000010011… |
… | …100000010011001001100001 |
3 | 122111220201011211210222110021 |
4 | 132113220103200103021201 |
5 | 120001313032333031103 |
6 | 1152023003132033441 |
7 | 40063524445350022 |
oct | 3627502340231141 |
9 | 574821154728407 |
10 | 133565220205153 |
11 | 396157678498a0 |
12 | 12b91a02002881 |
13 | 596b1b932b809 |
14 | 24da83c190c49 |
15 | 10695105c5bbd |
hex | 797a13813261 |
133565220205153 has 8 divisors (see below), whose sum is σ = 145717062089760. Its totient is φ = 121414969843680.
The previous prime is 133565220205141. The next prime is 133565220205189. The reversal of 133565220205153 is 351502022565331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133565220205153 is a prime.
It is a super-2 number, since 2×1335652202051532 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133565220205133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 397705300 + ... + 398040997.
It is an arithmetic number, because the mean of its divisors is an integer number (18214632761220).
Almost surely, 2133565220205153 is an apocalyptic number.
It is an amenable number.
133565220205153 is a deficient number, since it is larger than the sum of its proper divisors (12151841884607).
133565220205153 is a wasteful number, since it uses less digits than its factorization.
133565220205153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 795761567.
The product of its (nonzero) digits is 810000, while the sum is 43.
The spelling of 133565220205153 in words is "one hundred thirty-three trillion, five hundred sixty-five billion, two hundred twenty million, two hundred five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •