Base | Representation |
---|---|
bin | 10000010101100… |
… | …10001010101010 |
3 | 100112212120220210 |
4 | 20022302022222 |
5 | 240040412100 |
6 | 21333201550 |
7 | 3252601041 |
oct | 1012621252 |
9 | 315776823 |
10 | 137044650 |
11 | 703a3746 |
12 | 39a902b6 |
13 | 22514112 |
14 | 142b5558 |
15 | c070c50 |
hex | 82b22aa |
137044650 has 96 divisors (see below), whose sum is σ = 362976768. Its totient is φ = 34099200.
The previous prime is 137044619. The next prime is 137044679. The reversal of 137044650 is 56440731.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 568530 + ... + 568770.
It is an arithmetic number, because the mean of its divisors is an integer number (3781008).
Almost surely, 2137044650 is an apocalyptic number.
137044650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 137044650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181488384).
137044650 is an abundant number, since it is smaller than the sum of its proper divisors (225932118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137044650 is a wasteful number, since it uses less digits than its factorization.
137044650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 496 (or 491 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 30.
The square root of 137044650 is about 11706.6071088083. The cubic root of 137044650 is about 515.5696715656.
The spelling of 137044650 in words is "one hundred thirty-seven million, forty-four thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •