Base | Representation |
---|---|
bin | 111110001110110101… |
… | …0001001000101101001 |
3 | 110202221201012022021021 |
4 | 1330131222021011221 |
5 | 4142144220311323 |
6 | 141221042412441 |
7 | 12440522424265 |
oct | 1743552110551 |
9 | 422851168237 |
10 | 133641572713 |
11 | 5174a202660 |
12 | 21a98361121 |
13 | c7aa47c29c |
14 | 667ad9b0a5 |
15 | 37228d805d |
hex | 1f1da89169 |
133641572713 has 16 divisors (see below), whose sum is σ = 148198150080. Its totient is φ = 119491891200.
The previous prime is 133641572651. The next prime is 133641572723. The reversal of 133641572713 is 317275146331.
It is a de Polignac number, because none of the positive numbers 2k-133641572713 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133641572713.
It is not an unprimeable number, because it can be changed into a prime (133641572723) by changing a digit.
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, 330973 + ... + 613861.
It is an arithmetic number, because the mean of its divisors is an integer number (9262384380).
Almost surely, 2133641572713 is an apocalyptic number.
It is an amenable number.
133641572713 is a deficient number, since it is larger than the sum of its proper divisors (14556577367).
133641572713 is a wasteful number, since it uses less digits than its factorization.
133641572713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283608.
The product of its digits is 317520, while the sum is 43.
The spelling of 133641572713 in words is "one hundred thirty-three billion, six hundred forty-one million, five hundred seventy-two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •