Base | Representation |
---|---|
bin | 10000001000011… |
… | …10100110101001 |
3 | 100102122021112120 |
4 | 20010032212221 |
5 | 234120413441 |
6 | 21232301453 |
7 | 3232152540 |
oct | 1004164651 |
9 | 312567476 |
10 | 135326121 |
11 | 6a42a577 |
12 | 393a1889 |
13 | 22061b38 |
14 | 13d89157 |
15 | bd31966 |
hex | 810e9a9 |
135326121 has 32 divisors (see below), whose sum is σ = 211296000. Its totient is φ = 75444480.
The previous prime is 135326101. The next prime is 135326141. The reversal of 135326121 is 121623531.
It is an interprime number because it is at equal distance from previous prime (135326101) and next prime (135326141).
It is not a de Polignac number, because 135326121 - 29 = 135325609 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 135326091 and 135326100.
It is not an unprimeable number, because it can be changed into a prime (135326101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 190515 + ... + 191223.
It is an arithmetic number, because the mean of its divisors is an integer number (6603000).
Almost surely, 2135326121 is an apocalyptic number.
It is an amenable number.
135326121 is a deficient number, since it is larger than the sum of its proper divisors (75969879).
135326121 is a wasteful number, since it uses less digits than its factorization.
135326121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 929.
The product of its digits is 1080, while the sum is 24.
The square root of 135326121 is about 11632.9755866674. The cubic root of 135326121 is about 513.4055326102.
Adding to 135326121 its reverse (121623531), we get a palindrome (256949652).
The spelling of 135326121 in words is "one hundred thirty-five million, three hundred twenty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •