Base | Representation |
---|---|
bin | 11110101110101000001011… |
… | …101000101100011110100101 |
3 | 122201111210111202020112200222 |
4 | 132232220023220230132211 |
5 | 120203211230323401003 |
6 | 1155233014222414125 |
7 | 40315643564303615 |
oct | 3656501350543645 |
9 | 581453452215628 |
10 | 135145636153253 |
11 | 3a074a40407220 |
12 | 131a8168131345 |
13 | 5a54242ab355b |
14 | 255312590ca45 |
15 | 10956ac702c38 |
hex | 7aea0ba2c7a5 |
135145636153253 has 8 divisors (see below), whose sum is σ = 148507746166080. Its totient is φ = 121962883322080.
The previous prime is 135145636153211. The next prime is 135145636153313. The reversal of 135145636153253 is 352351636541531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 135145636153253 - 214 = 135145636136869 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 135145636153195 and 135145636153204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135145636150253) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44839293833 + ... + 44839296846.
It is an arithmetic number, because the mean of its divisors is an integer number (18563468270760).
Almost surely, 2135145636153253 is an apocalyptic number.
It is an amenable number.
135145636153253 is a deficient number, since it is larger than the sum of its proper divisors (13362110012827).
135145636153253 is a wasteful number, since it uses less digits than its factorization.
135145636153253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89678590827.
The product of its digits is 14580000, while the sum is 53.
The spelling of 135145636153253 in words is "one hundred thirty-five trillion, one hundred forty-five billion, six hundred thirty-six million, one hundred fifty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •