Base | Representation |
---|---|
bin | 111111000111011110… |
… | …1100001000101111101 |
3 | 110221212012002020222110 |
4 | 1332032331201011331 |
5 | 4210042333232211 |
6 | 142133425404233 |
7 | 12535604021646 |
oct | 1761675410575 |
9 | 427765066873 |
10 | 135542477181 |
11 | 52535216291 |
12 | 22328a99679 |
13 | ca2123b727 |
14 | 67bb61c6cd |
15 | 37d4723ea6 |
hex | 1f8ef6117d |
135542477181 has 16 divisors (see below), whose sum is σ = 191810808000. Its totient is φ = 84843272448.
The previous prime is 135542477173. The next prime is 135542477183. The reversal of 135542477181 is 181774245531.
It is not a de Polignac number, because 135542477181 - 23 = 135542477173 is a prime.
It is a super-4 number, since 4×1355424771814 (a number of 46 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 135542477181.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135542477183) 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 15 ways as a sum of consecutive naturals, for example, 3150106 + ... + 3192843.
It is an arithmetic number, because the mean of its divisors is an integer number (11988175500).
Almost surely, 2135542477181 is an apocalyptic number.
It is an amenable number.
135542477181 is a deficient number, since it is larger than the sum of its proper divisors (56268330819).
135542477181 is a wasteful number, since it uses less digits than its factorization.
135542477181 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6343388.
The product of its digits is 940800, while the sum is 48.
The spelling of 135542477181 in words is "one hundred thirty-five billion, five hundred forty-two million, four hundred seventy-seven thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •