Base | Representation |
---|---|
bin | 10000001111010… |
… | …10011001000001 |
3 | 100111100000110002 |
4 | 20013222121001 |
5 | 234333220434 |
6 | 21303445345 |
7 | 3242622266 |
oct | 1007523101 |
9 | 314300402 |
10 | 136226369 |
11 | 6a994984 |
12 | 39756855 |
13 | 222b8826 |
14 | 1414126d |
15 | be5d57e |
hex | 81ea641 |
136226369 has 8 divisors (see below), whose sum is σ = 145470720. Its totient is φ = 127285200.
The previous prime is 136226353. The next prime is 136226381. The reversal of 136226369 is 963622631.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 136226369 - 24 = 136226353 is a prime.
It is a super-2 number, since 2×1362263692 = 37115247221848322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136226329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74867 + ... + 76664.
It is an arithmetic number, because the mean of its divisors is an integer number (18183840).
Almost surely, 2136226369 is an apocalyptic number.
It is an amenable number.
136226369 is a deficient number, since it is larger than the sum of its proper divisors (9244351).
136226369 is a wasteful number, since it uses less digits than its factorization.
136226369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151591.
The product of its digits is 69984, while the sum is 38.
The square root of 136226369 is about 11671.6052452094. The cubic root of 136226369 is about 514.5414827393.
It can be divided in two parts, 13622 and 6369, that added together give a palindrome (19991).
The spelling of 136226369 in words is "one hundred thirty-six million, two hundred twenty-six thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •