Base | Representation |
---|---|
bin | 11110111011000111110100… |
… | …100011000101100011001000 |
3 | 122211112212201111010022000120 |
4 | 132323013310203011203020 |
5 | 120311243142010010222 |
6 | 1201131253015303240 |
7 | 40434660623661210 |
oct | 3673076443054310 |
9 | 584485644108016 |
10 | 136004242266312 |
11 | 3a3760911550a2 |
12 | 1330664967ab20 |
13 | 5ab71b679bc24 |
14 | 25828d7567240 |
15 | 10acbb0bae15c |
hex | 7bb1f48c58c8 |
136004242266312 has 64 divisors (see below), whose sum is σ = 390556054753920. Its totient is φ = 38661104391168.
The previous prime is 136004242266187. The next prime is 136004242266449. The reversal of 136004242266312 is 213662242400631.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2054659953 + ... + 2054726144.
It is an arithmetic number, because the mean of its divisors is an integer number (6102438355530).
Almost surely, 2136004242266312 is an apocalyptic number.
136004242266312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
136004242266312 is an abundant number, since it is smaller than the sum of its proper divisors (254551812487608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136004242266312 is a wasteful number, since it uses less digits than its factorization.
136004242266312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4109386310 (or 4109386306 counting only the distinct ones).
The product of its (nonzero) digits is 497664, while the sum is 42.
Adding to 136004242266312 its reverse (213662242400631), we get a palindrome (349666484666943).
The spelling of 136004242266312 in words is "one hundred thirty-six trillion, four billion, two hundred forty-two million, two hundred sixty-six thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •