Base | Representation |
---|---|
bin | 111111000111010011… |
… | …0010110101000101000 |
3 | 110221211202122202120001 |
4 | 1332032212112220220 |
5 | 4210034304430112 |
6 | 142133051312344 |
7 | 12535501301620 |
oct | 1761646265050 |
9 | 427752582501 |
10 | 135536405032 |
11 | 52531849186 |
12 | 22326a4b6b4 |
13 | ca1cbc3942 |
14 | 67ba8bb880 |
15 | 37d3e24c57 |
hex | 1f8e996a28 |
135536405032 has 64 divisors (see below), whose sum is σ = 292202951040. Its totient is φ = 57734073600.
The previous prime is 135536405029. The next prime is 135536405047. The reversal of 135536405032 is 230504635531.
It is a junction number, because it is equal to n+sod(n) for n = 135536404982 and 135536405000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12030282 + ... + 12041542.
It is an arithmetic number, because the mean of its divisors is an integer number (4565671110).
Almost surely, 2135536405032 is an apocalyptic number.
It is an amenable number.
135536405032 is an abundant number, since it is smaller than the sum of its proper divisors (156666546008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135536405032 is a wasteful number, since it uses less digits than its factorization.
135536405032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12562 (or 12558 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 37.
The spelling of 135536405032 in words is "one hundred thirty-five billion, five hundred thirty-six million, four hundred five thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •