Base | Representation |
---|---|
bin | 10010111001000… |
… | …00000010011000 |
3 | 102001011220202112 |
4 | 21130200002120 |
5 | 311031404300 |
6 | 23420251452 |
7 | 3632640404 |
oct | 1134400230 |
9 | 361156675 |
10 | 158466200 |
11 | 814a5002 |
12 | 450a0b88 |
13 | 26aa45a9 |
14 | 17090104 |
15 | dda2e35 |
hex | 9720098 |
158466200 has 48 divisors (see below), whose sum is σ = 369987480. Its totient is φ = 63119360.
The previous prime is 158466199. The next prime is 158466233. The reversal of 158466200 is 2664851.
158466200 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1584662002 = 50223073084880000, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 49859 + ... + 52941.
Almost surely, 2158466200 is an apocalyptic number.
158466200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 158466200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (184993740).
158466200 is an abundant number, since it is smaller than the sum of its proper divisors (211521280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
158466200 is a wasteful number, since it uses less digits than its factorization.
158466200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3356 (or 3347 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 32.
The square root of 158466200 is about 12588.3358709561. The cubic root of 158466200 is about 541.1432113349.
The spelling of 158466200 in words is "one hundred fifty-eight million, four hundred sixty-six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •