Base | Representation |
---|---|
bin | 111110010000011100… |
… | …0001001001111011101 |
3 | 110210002110210220111011 |
4 | 1330200320021033131 |
5 | 4142302031400010 |
6 | 141230252055221 |
7 | 12442046431336 |
oct | 1744070111735 |
9 | 423073726434 |
10 | 133695575005 |
11 | 51777737353 |
12 | 21ab2464511 |
13 | c7b87092c5 |
14 | 668421728d |
15 | 3727503a8a |
hex | 1f20e093dd |
133695575005 has 16 divisors (see below), whose sum is σ = 163169697600. Its totient is φ = 105133472640.
The previous prime is 133695574993. The next prime is 133695575011. The reversal of 133695575005 is 500575596331.
It is a de Polignac number, because none of the positive numbers 2k-133695575005 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133695575005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4921510 + ... + 4948600.
It is an arithmetic number, because the mean of its divisors is an integer number (10198106100).
Almost surely, 2133695575005 is an apocalyptic number.
It is an amenable number.
133695575005 is a deficient number, since it is larger than the sum of its proper divisors (29474122595).
133695575005 is a wasteful number, since it uses less digits than its factorization.
133695575005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43884.
The product of its (nonzero) digits is 2126250, while the sum is 49.
The spelling of 133695575005 in words is "one hundred thirty-three billion, six hundred ninety-five million, five hundred seventy-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •