Base | Representation |
---|---|
bin | 10000010101011… |
… | …10101000111010 |
3 | 100112211212002200 |
4 | 20022232220322 |
5 | 240034431302 |
6 | 21333011030 |
7 | 3252510651 |
oct | 1012565072 |
9 | 315755080 |
10 | 137030202 |
11 | 70393901 |
12 | 39a83a76 |
13 | 2250a67a |
14 | 142b0198 |
15 | c06b81c |
hex | 82aea3a |
137030202 has 12 divisors (see below), whose sum is σ = 296898810. Its totient is φ = 45676728.
The previous prime is 137030171. The next prime is 137030219. The reversal of 137030202 is 202030731.
137030202 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 113614281 + 23415921 = 10659^2 + 4839^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 7612789 = 137030202 / (1 + 3 + 7 + 0 + 3 + 0 + 2 + 0 + 2).
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 3806377 + ... + 3806412.
Almost surely, 2137030202 is an apocalyptic number.
137030202 is an abundant number, since it is smaller than the sum of its proper divisors (159868608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137030202 is a wasteful number, since it uses less digits than its factorization.
137030202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7612797 (or 7612794 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 18.
The square root of 137030202 is about 11705.9900051213. The cubic root of 137030202 is about 515.5515528663.
Adding to 137030202 its reverse (202030731), we get a palindrome (339060933).
The spelling of 137030202 in words is "one hundred thirty-seven million, thirty thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •