Base | Representation |
---|---|
bin | 10000000110010… |
… | …11101011111111 |
3 | 100102010100120002 |
4 | 20003023223333 |
5 | 234033131111 |
6 | 21222344515 |
7 | 3226631462 |
oct | 1003135377 |
9 | 312110502 |
10 | 135052031 |
11 | 6a262654 |
12 | 3928b13b |
13 | 21c9715a |
14 | 13d172d9 |
15 | bcca63b |
hex | 80cbaff |
135052031 has 2 divisors, whose sum is σ = 135052032. Its totient is φ = 135052030.
The previous prime is 135052013. The next prime is 135052051. The reversal of 135052031 is 130250531.
Together with previous prime (135052013) it forms an Ormiston pair, because they use the same digits, order apart.
It is an a-pointer prime, because the next prime (135052051) can be obtained adding 135052031 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 135052031 - 214 = 135035647 is a prime.
It is a super-2 number, since 2×1350520312 = 36478102154449922, which contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 135051994 and 135052012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135052051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67526015 + 67526016.
It is an arithmetic number, because the mean of its divisors is an integer number (67526016).
Almost surely, 2135052031 is an apocalyptic number.
135052031 is a deficient number, since it is larger than the sum of its proper divisors (1).
135052031 is an equidigital number, since it uses as much as digits as its factorization.
135052031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 135052031 is about 11621.1888806610. The cubic root of 135052031 is about 513.0586805442.
The spelling of 135052031 in words is "one hundred thirty-five million, fifty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •