Base | Representation |
---|---|
bin | 111110111000000011… |
… | …1100010101110011100 |
3 | 110220112010101021200000 |
4 | 1331300013202232130 |
5 | 4203012400332422 |
6 | 142010222334300 |
7 | 12520021442661 |
oct | 1756007425634 |
9 | 426463337600 |
10 | 135025011612 |
11 | 5229a10a797 |
12 | 2220372a390 |
13 | c96ac7c99a |
14 | 676c9dba68 |
15 | 37a40aacac |
hex | 1f701e2b9c |
135025011612 has 36 divisors (see below), whose sum is σ = 353954456856. Its totient is φ = 45008336880.
The previous prime is 135025011593. The next prime is 135025011619. The reversal of 135025011612 is 216110520531.
135025011612 is a `hidden beast` number, since 1 + 35 + 0 + 2 + 5 + 0 + 11 + 612 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135025011619) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 69456339 + ... + 69458282.
It is an arithmetic number, because the mean of its divisors is an integer number (9832068246).
Almost surely, 2135025011612 is an apocalyptic number.
135025011612 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
135025011612 is an abundant number, since it is smaller than the sum of its proper divisors (218929445244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135025011612 is a wasteful number, since it uses less digits than its factorization.
135025011612 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138914640 (or 138914626 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
The spelling of 135025011612 in words is "one hundred thirty-five billion, twenty-five million, eleven thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •