Base | Representation |
---|---|
bin | 11110110101100011001110… |
… | …110000000011010010010001 |
3 | 122210012021102111010202222002 |
4 | 132311203032300003102101 |
5 | 120234010014121310421 |
6 | 1200235331342523345 |
7 | 40365214426525121 |
oct | 3665431660032221 |
9 | 583167374122862 |
10 | 135621356041361 |
11 | 3a23876a931243 |
12 | 132643b1896555 |
13 | 5a8a0678ab6c8 |
14 | 256c17421cc81 |
15 | 10a2c51963b0b |
hex | 7b58cec03491 |
135621356041361 has 4 divisors (see below), whose sum is σ = 135653425413300. Its totient is φ = 135589286669424.
The previous prime is 135621356041333. The next prime is 135621356041393. The reversal of 135621356041361 is 163140653126531.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 109881359669761 + 25739996371600 = 10482431^2 + 5073460^2 .
It is a cyclic number.
It is not a de Polignac number, because 135621356041361 - 226 = 135621288932497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135621356041261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16034679626 + ... + 16034688083.
It is an arithmetic number, because the mean of its divisors is an integer number (33913356353325).
Almost surely, 2135621356041361 is an apocalyptic number.
It is an amenable number.
135621356041361 is a deficient number, since it is larger than the sum of its proper divisors (32069371939).
135621356041361 is an equidigital number, since it uses as much as digits as its factorization.
135621356041361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32069371938.
The product of its (nonzero) digits is 1166400, while the sum is 47.
The spelling of 135621356041361 in words is "one hundred thirty-five trillion, six hundred twenty-one billion, three hundred fifty-six million, forty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •