Base | Representation |
---|---|
bin | 11110110110011011001111… |
… | …110111011100101111100011 |
3 | 122210102000200022200220100010 |
4 | 132312123033313130233203 |
5 | 120241001210100100003 |
6 | 1200323120024500003 |
7 | 40402444106350554 |
oct | 3666331767345743 |
9 | 583360608626303 |
10 | 135681504300003 |
11 | 3a261225a71202 |
12 | 13273b9931a603 |
13 | 5a92931c77cac |
14 | 257103c66632b |
15 | 10a45c2200003 |
hex | 7b66cfddcbe3 |
135681504300003 has 8 divisors (see below), whose sum is σ = 181320765049600. Its totient is φ = 90248289875208.
The previous prime is 135681504299989. The next prime is 135681504300011. The reversal of 135681504300003 is 300003405186531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 135681504300003 - 213 = 135681504291811 is a prime.
It is a super-2 number, since 2×1356815043000032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135681504310003) 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, 51511579663 + ... + 51511582296.
It is an arithmetic number, because the mean of its divisors is an integer number (22665095631200).
Almost surely, 2135681504300003 is an apocalyptic number.
135681504300003 is a deficient number, since it is larger than the sum of its proper divisors (45639260749597).
135681504300003 is a wasteful number, since it uses less digits than its factorization.
135681504300003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103023162401.
The product of its (nonzero) digits is 129600, while the sum is 39.
Adding to 135681504300003 its reverse (300003405186531), we get a palindrome (435684909486534).
The spelling of 135681504300003 in words is "one hundred thirty-five trillion, six hundred eighty-one billion, five hundred four million, three hundred thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •