Base | Representation |
---|---|
bin | 111110111000001101… |
… | …0100111110100101111 |
3 | 110220112110210101121011 |
4 | 1331300122213310233 |
5 | 4203020140410411 |
6 | 142010521450051 |
7 | 12520112113651 |
oct | 1756032476457 |
9 | 426473711534 |
10 | 135030013231 |
11 | 522a1a16563 |
12 | 22205340927 |
13 | c96c011419 |
14 | 676d5406d1 |
15 | 37a4747c21 |
hex | 1f706a7d2f |
135030013231 has 2 divisors, whose sum is σ = 135030013232. Its totient is φ = 135030013230.
The previous prime is 135030013213. The next prime is 135030013241. The reversal of 135030013231 is 132310030531.
It is a happy number.
Together with previous prime (135030013213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 135030013231 - 25 = 135030013199 is a prime.
It is a super-2 number, since 2×1350300132312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135030013241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67515006615 + 67515006616.
It is an arithmetic number, because the mean of its divisors is an integer number (67515006616).
Almost surely, 2135030013231 is an apocalyptic number.
135030013231 is a deficient number, since it is larger than the sum of its proper divisors (1).
135030013231 is an equidigital number, since it uses as much as digits as its factorization.
135030013231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 22.
Adding to 135030013231 its reverse (132310030531), we get a palindrome (267340043762).
The spelling of 135030013231 in words is "one hundred thirty-five billion, thirty million, thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •