Base | Representation |
---|---|
bin | 111111011100101101… |
… | …0101011100110001011 |
3 | 111000200211101020210111 |
4 | 1332321122223212023 |
5 | 4213022204443301 |
6 | 142332232255151 |
7 | 12562343253100 |
oct | 1767132534613 |
9 | 430624336714 |
10 | 136254765451 |
11 | 52870298a82 |
12 | 224a75414b7 |
13 | cb0599108c |
14 | 6848074aa7 |
15 | 3827022551 |
hex | 1fb96ab98b |
136254765451 has 24 divisors (see below), whose sum is σ = 175120716960. Its totient is φ = 105140673792.
The previous prime is 136254765389. The next prime is 136254765529. The reversal of 136254765451 is 154567452631.
It is not a de Polignac number, because 136254765451 - 29 = 136254764939 is a prime.
It is a super-2 number, since 2×1362547654512 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a junction number, because it is equal to n+sod(n) for n = 136254765395 and 136254765404.
It is not an unprimeable number, because it can be changed into a prime (136254765551) 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 23 ways as a sum of consecutive naturals, for example, 3536736 + ... + 3575053.
It is an arithmetic number, because the mean of its divisors is an integer number (7296696540).
Almost surely, 2136254765451 is an apocalyptic number.
136254765451 is a deficient number, since it is larger than the sum of its proper divisors (38865951509).
136254765451 is a wasteful number, since it uses less digits than its factorization.
136254765451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7111843 (or 7111836 counting only the distinct ones).
The product of its digits is 3024000, while the sum is 49.
The spelling of 136254765451 in words is "one hundred thirty-six billion, two hundred fifty-four million, seven hundred sixty-five thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •