Base | Representation |
---|---|
bin | 101101101000000001000… |
… | …111111111111011000101 |
3 | 102002201212120202122211211 |
4 | 231220001013333323011 |
5 | 402332141310001013 |
6 | 10400205124331421 |
7 | 442343525530153 |
oct | 55500107777305 |
9 | 12081776678754 |
10 | 3135345000133 |
11 | aa9768572595 |
12 | 427798843b71 |
13 | 19987ab887b8 |
14 | aba741cc3d3 |
15 | 5685695b23d |
hex | 2da011ffec5 |
3135345000133 has 2 divisors, whose sum is σ = 3135345000134. Its totient is φ = 3135345000132.
The previous prime is 3135345000121. The next prime is 3135345000163. The reversal of 3135345000133 is 3310005435313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2201537802564 + 933807197569 = 1483758^2 + 966337^2 .
It is a cyclic number.
It is not a de Polignac number, because 3135345000133 - 25 = 3135345000101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3135345000095 and 3135345000104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3135345000163) 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, 1567672500066 + 1567672500067.
It is an arithmetic number, because the mean of its divisors is an integer number (1567672500067).
Almost surely, 23135345000133 is an apocalyptic number.
It is an amenable number.
3135345000133 is a deficient number, since it is larger than the sum of its proper divisors (1).
3135345000133 is an equidigital number, since it uses as much as digits as its factorization.
3135345000133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24300, while the sum is 31.
The spelling of 3135345000133 in words is "three trillion, one hundred thirty-five billion, three hundred forty-five million, one hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •