Base | Representation |
---|---|
bin | 11110110010100010001001… |
… | …111000100110010110100011 |
3 | 122202110110022102121200020111 |
4 | 132302202021320212112203 |
5 | 120222110424302132120 |
6 | 1200000204024152151 |
7 | 40344225126253411 |
oct | 3662421170462643 |
9 | 582413272550214 |
10 | 135414042224035 |
11 | 3a168855664913 |
12 | 13230194908657 |
13 | 5a7364925b593 |
14 | 2562108a522b1 |
15 | 109c66b38775a |
hex | 7b2889e265a3 |
135414042224035 has 8 divisors (see below), whose sum is σ = 162498213230976. Its totient is φ = 108330325404480.
The previous prime is 135414042224029. The next prime is 135414042224039. The reversal of 135414042224035 is 530422240414531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 135414042224035 - 223 = 135414033835427 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135414042224039) 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 in 7 ways as a sum of consecutive naturals, for example, 112890579 + ... + 114083788.
It is an arithmetic number, because the mean of its divisors is an integer number (20312276653872).
Almost surely, 2135414042224035 is an apocalyptic number.
135414042224035 is a deficient number, since it is larger than the sum of its proper divisors (27084171006941).
135414042224035 is a wasteful number, since it uses less digits than its factorization.
135414042224035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227093693.
The product of its (nonzero) digits is 460800, while the sum is 40.
Adding to 135414042224035 its reverse (530422240414531), we get a palindrome (665836282638566).
The spelling of 135414042224035 in words is "one hundred thirty-five trillion, four hundred fourteen billion, forty-two million, two hundred twenty-four thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.203 sec. • engine limits •