Base | Representation |
---|---|
bin | 1111111010110… |
… | …10100100001001 |
3 | 100022021112120211 |
4 | 13331122210021 |
5 | 233141240410 |
6 | 21130121121 |
7 | 3211033516 |
oct | 775324411 |
9 | 308245524 |
10 | 133540105 |
11 | 6941a726 |
12 | 388801a1 |
13 | 21887c1a |
14 | 13a4230d |
15 | bacc68a |
hex | 7f5a909 |
133540105 has 4 divisors (see below), whose sum is σ = 160248132. Its totient is φ = 106832080.
The previous prime is 133540103. The next prime is 133540177. The reversal of 133540105 is 501045331.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 89927289 + 43612816 = 9483^2 + 6604^2 .
It is not a de Polignac number, because 133540105 - 21 = 133540103 is a prime.
It is a super-2 number, since 2×1335401052 = 35665919286822050, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133540103) 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, 13354006 + ... + 13354015.
It is an arithmetic number, because the mean of its divisors is an integer number (40062033).
Almost surely, 2133540105 is an apocalyptic number.
It is an amenable number.
133540105 is a deficient number, since it is larger than the sum of its proper divisors (26708027).
133540105 is an equidigital number, since it uses as much as digits as its factorization.
133540105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26708026.
The product of its (nonzero) digits is 900, while the sum is 22.
The square root of 133540105 is about 11555.9553910527. The cubic root of 133540105 is about 511.1369036641.
Adding to 133540105 its reverse (501045331), we get a palindrome (634585436).
The spelling of 133540105 in words is "one hundred thirty-three million, five hundred forty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •