Base | Representation |
---|---|
bin | 11110110011000101111001… |
… | …100000101010101000101111 |
3 | 122202121010101012100111102221 |
4 | 132303011321200222220233 |
5 | 120223223030042022320 |
6 | 1200025552252500211 |
7 | 40350054202661353 |
oct | 3663057140525057 |
9 | 582533335314387 |
10 | 135452422220335 |
11 | 3a183060119120 |
12 | 1323770617a667 |
13 | 5a771547c306c |
14 | 2563d09ddd463 |
15 | 109d665a1d3aa |
hex | 7b317982aa2f |
135452422220335 has 8 divisors (see below), whose sum is σ = 177319534543056. Its totient is φ = 98510852523840.
The previous prime is 135452422220327. The next prime is 135452422220347. The reversal of 135452422220335 is 533022224254531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 135452422220335 - 23 = 135452422220327 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 135452422220291 and 135452422220300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1231385656494 + ... + 1231385656603.
It is an arithmetic number, because the mean of its divisors is an integer number (22164941817882).
Almost surely, 2135452422220335 is an apocalyptic number.
135452422220335 is a deficient number, since it is larger than the sum of its proper divisors (41867112322721).
135452422220335 is a wasteful number, since it uses less digits than its factorization.
135452422220335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2462771313113.
The product of its (nonzero) digits is 1728000, while the sum is 43.
Adding to 135452422220335 its reverse (533022224254531), we get a palindrome (668474646474866).
The spelling of 135452422220335 in words is "one hundred thirty-five trillion, four hundred fifty-two billion, four hundred twenty-two million, two hundred twenty thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •