Base | Representation |
---|---|
bin | 11110110100010111011101… |
… | …110110111101011011100001 |
3 | 122202220111110000001101201010 |
4 | 132310113131312331123201 |
5 | 120231141412303211001 |
6 | 1200134115130331133 |
7 | 40356304452310221 |
oct | 3664273566753341 |
9 | 582814400041633 |
10 | 135540005132001 |
11 | 3a207214415a48 |
12 | 13250689589aa9 |
13 | 5a824a1925652 |
14 | 2568257cb0081 |
15 | 10a0a8ea9a8d6 |
hex | 7b45dddbd6e1 |
135540005132001 has 8 divisors (see below), whose sum is σ = 191350595480544. Its totient is φ = 85044709102400.
The previous prime is 135540005131991. The next prime is 135540005132009. The reversal of 135540005132001 is 100231500045531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 135540005132001 - 210 = 135540005130977 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 135540005132001.
It is not an unprimeable number, because it can be changed into a prime (135540005132009) 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, 1328823579675 + ... + 1328823579776.
It is an arithmetic number, because the mean of its divisors is an integer number (23918824435068).
Almost surely, 2135540005132001 is an apocalyptic number.
It is an amenable number.
135540005132001 is a deficient number, since it is larger than the sum of its proper divisors (55810590348543).
135540005132001 is a wasteful number, since it uses less digits than its factorization.
135540005132001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2657647159471.
The product of its (nonzero) digits is 9000, while the sum is 30.
Adding to 135540005132001 its reverse (100231500045531), we get a palindrome (235771505177532).
The spelling of 135540005132001 in words is "one hundred thirty-five trillion, five hundred forty billion, five million, one hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •