Base | Representation |
---|---|
bin | 111101111111000101… |
… | …1110111001110011011 |
3 | 110201120220121112122211 |
4 | 1323332023313032123 |
5 | 4140104031312111 |
6 | 141052421055551 |
7 | 12421451301625 |
oct | 1737613671633 |
9 | 421526545584 |
10 | 133113541531 |
11 | 514a913aa53 |
12 | 2196b5575b7 |
13 | c724c613b9 |
14 | 662abc9c15 |
15 | 36e1384521 |
hex | 1efe2f739b |
133113541531 has 4 divisors (see below), whose sum is σ = 133782454000. Its totient is φ = 132444629064.
The previous prime is 133113541513. The next prime is 133113541577. The reversal of 133113541531 is 135145311331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 133113541531 - 219 = 133113017243 is a prime.
It is a super-2 number, since 2×1331135415312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133113541493 and 133113541502.
It is not an unprimeable number, because it can be changed into a prime (133113541501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 334455936 + ... + 334456333.
It is an arithmetic number, because the mean of its divisors is an integer number (33445613500).
Almost surely, 2133113541531 is an apocalyptic number.
133113541531 is a deficient number, since it is larger than the sum of its proper divisors (668912469).
133113541531 is an equidigital number, since it uses as much as digits as its factorization.
133113541531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 668912468.
The product of its digits is 8100, while the sum is 31.
Adding to 133113541531 its reverse (135145311331), we get a palindrome (268258852862).
The spelling of 133113541531 in words is "one hundred thirty-three billion, one hundred thirteen million, five hundred forty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •