Base | Representation |
---|---|
bin | 10000010101011… |
… | …00110110010000 |
3 | 100112211111000220 |
4 | 20022230312100 |
5 | 240034212424 |
6 | 21332513040 |
7 | 3252450366 |
oct | 1012546620 |
9 | 315744026 |
10 | 137022864 |
11 | 70389340 |
12 | 39a7b780 |
13 | 22507224 |
14 | 142ab636 |
15 | c069579 |
hex | 82acd90 |
137022864 has 80 divisors (see below), whose sum is σ = 389141760. Its totient is φ = 41201280.
The previous prime is 137022863. The next prime is 137022869. The reversal of 137022864 is 468220731.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (137022863) 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 15 ways as a sum of consecutive naturals, for example, 72459 + ... + 74325.
It is an arithmetic number, because the mean of its divisors is an integer number (4864272).
Almost surely, 2137022864 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 137022864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (194570880).
137022864 is an abundant number, since it is smaller than the sum of its proper divisors (252118896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137022864 is a wasteful number, since it uses less digits than its factorization.
137022864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2028 (or 2022 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 33.
The square root of 137022864 is about 11705.6765716468. The cubic root of 137022864 is about 515.5423500658.
The spelling of 137022864 in words is "one hundred thirty-seven million, twenty-two thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •