Base | Representation |
---|---|
bin | 10000001111010… |
… | …10100010111001 |
3 | 100111100001022111 |
4 | 20013222202321 |
5 | 234333231001 |
6 | 21303452321 |
7 | 3242624161 |
oct | 1007524271 |
9 | 314301274 |
10 | 136227001 |
11 | 6a9953a9 |
12 | 397570a1 |
13 | 222b8bc1 |
14 | 141415a1 |
15 | be5d851 |
hex | 81ea8b9 |
136227001 has 8 divisors (see below), whose sum is σ = 145565640. Its totient is φ = 127035648.
The previous prime is 136226971. The next prime is 136227011. The reversal of 136227001 is 100722631.
It can be written as a sum of positive squares in 4 ways, for example, as 84732025 + 51494976 = 9205^2 + 7176^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136227001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136227011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34906 + ... + 38611.
It is an arithmetic number, because the mean of its divisors is an integer number (18195705).
Almost surely, 2136227001 is an apocalyptic number.
It is an amenable number.
136227001 is a deficient number, since it is larger than the sum of its proper divisors (9338639).
136227001 is a wasteful number, since it uses less digits than its factorization.
136227001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73643.
The product of its (nonzero) digits is 504, while the sum is 22.
The square root of 136227001 is about 11671.6323194316. The cubic root of 136227001 is about 514.5422784484.
Adding to 136227001 its reverse (100722631), we get a palindrome (236949632).
The spelling of 136227001 in words is "one hundred thirty-six million, two hundred twenty-seven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •