Base | Representation |
---|---|
bin | 111110001011010000… |
… | …0001110011000010011 |
3 | 110202122100022121222001 |
4 | 1330112200032120103 |
5 | 4141423003014220 |
6 | 141201113454431 |
7 | 12434534204524 |
oct | 1742640163023 |
9 | 422570277861 |
10 | 133521532435 |
11 | 51698473615 |
12 | 21a64111417 |
13 | c78b63cc35 |
14 | 666907084b |
15 | 37170c580a |
hex | 1f1680e613 |
133521532435 has 16 divisors (see below), whose sum is σ = 160420708800. Its totient is φ = 106687397376.
The previous prime is 133521532433. The next prime is 133521532457. The reversal of 133521532435 is 534235125331.
It is a cyclic number.
It is not a de Polignac number, because 133521532435 - 21 = 133521532433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133521532394 and 133521532403.
It is not an unprimeable number, because it can be changed into a prime (133521532433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23270887 + ... + 23276623.
It is an arithmetic number, because the mean of its divisors is an integer number (10026294300).
Almost surely, 2133521532435 is an apocalyptic number.
133521532435 is a deficient number, since it is larger than the sum of its proper divisors (26899176365).
133521532435 is a wasteful number, since it uses less digits than its factorization.
133521532435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10590.
The product of its digits is 162000, while the sum is 37.
Adding to 133521532435 its reverse (534235125331), we get a palindrome (667756657766).
The spelling of 133521532435 in words is "one hundred thirty-three billion, five hundred twenty-one million, five hundred thirty-two thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •