Base | Representation |
---|---|
bin | 10000001111010… |
… | …11000110001110 |
3 | 100111100011102020 |
4 | 20013223012032 |
5 | 234333314022 |
6 | 21303511010 |
7 | 3242633601 |
oct | 1007530616 |
9 | 314304366 |
10 | 136229262 |
11 | 6a997074 |
12 | 39758466 |
13 | 222b9c40 |
14 | 14142338 |
15 | be5e35c |
hex | 81eb18e |
136229262 has 64 divisors (see below), whose sum is σ = 315270144. Its totient is φ = 38868480.
The previous prime is 136229257. The next prime is 136229267. The reversal of 136229262 is 262922631.
It is an interprime number because it is at equal distance from previous prime (136229257) and next prime (136229267).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136229267) 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 31 ways as a sum of consecutive naturals, for example, 93423 + ... + 94869.
It is an arithmetic number, because the mean of its divisors is an integer number (4926096).
Almost surely, 2136229262 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 136229262, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157635072).
136229262 is an abundant number, since it is smaller than the sum of its proper divisors (179040882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136229262 is a wasteful number, since it uses less digits than its factorization.
136229262 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1553.
The product of its digits is 15552, while the sum is 33.
The square root of 136229262 is about 11671.7291778039. The cubic root of 136229262 is about 514.5451251030.
The spelling of 136229262 in words is "one hundred thirty-six million, two hundred twenty-nine thousand, two hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •