Base | Representation |
---|---|
bin | 10000001001110… |
… | …10010111100101 |
3 | 100102222101102211 |
4 | 20010322113211 |
5 | 234142133011 |
6 | 21240203421 |
7 | 3233530264 |
oct | 1004722745 |
9 | 312871384 |
10 | 135505381 |
11 | 6a542220 |
12 | 39469571 |
13 | 220c55cb |
14 | 13dd45db |
15 | bd69b21 |
hex | 813a5e5 |
135505381 has 8 divisors (see below), whose sum is σ = 148190400. Its totient is φ = 122881440.
The previous prime is 135505379. The next prime is 135505393. The reversal of 135505381 is 183505531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 135505381 - 21 = 135505379 is a prime.
It is a super-2 number, since 2×1355053812 = 36723416559910322, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135505481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10561 + ... + 19558.
It is an arithmetic number, because the mean of its divisors is an integer number (18523800).
Almost surely, 2135505381 is an apocalyptic number.
135505381 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
135505381 is a deficient number, since it is larger than the sum of its proper divisors (12685019).
135505381 is a wasteful number, since it uses less digits than its factorization.
135505381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30539.
The product of its (nonzero) digits is 9000, while the sum is 31.
The square root of 135505381 is about 11640.6778582693. The cubic root of 135505381 is about 513.6321271205.
The spelling of 135505381 in words is "one hundred thirty-five million, five hundred five thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •