Base | Representation |
---|---|
bin | 11110110101110000101011… |
… | …011010011000101111000111 |
3 | 122210020122200210121120020022 |
4 | 132311300223122120233013 |
5 | 120234224102124420111 |
6 | 1200250120235325355 |
7 | 40366235312345345 |
oct | 3665605332305707 |
9 | 583218623546208 |
10 | 135635795545031 |
11 | 3a2438aa627051 |
12 | 132671615b085b |
13 | 5a8b529280812 |
14 | 256cb43c20995 |
15 | 10a32e94602db |
hex | 7b5c2b698bc7 |
135635795545031 has 4 divisors (see below), whose sum is σ = 136026676800552. Its totient is φ = 135244914289512.
The previous prime is 135635795545013. The next prime is 135635795545039. The reversal of 135635795545031 is 130545597536531.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 135635795545031 - 214 = 135635795528647 is a prime.
It is a super-2 number, since 2×1356357955450312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135635795545039) 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, 195440627240 + ... + 195440627933.
It is an arithmetic number, because the mean of its divisors is an integer number (34006669200138).
Almost surely, 2135635795545031 is an apocalyptic number.
135635795545031 is a deficient number, since it is larger than the sum of its proper divisors (390881255521).
135635795545031 is an equidigital number, since it uses as much as digits as its factorization.
135635795545031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 390881255520.
The product of its (nonzero) digits is 127575000, while the sum is 62.
The spelling of 135635795545031 in words is "one hundred thirty-five trillion, six hundred thirty-five billion, seven hundred ninety-five million, five hundred forty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •