Base | Representation |
---|---|
bin | 10010100000001… |
… | …01000100010000 |
3 | 101211001111002112 |
4 | 21100011010100 |
5 | 304213210000 |
6 | 23222404452 |
7 | 3563156201 |
oct | 1120050420 |
9 | 354044075 |
10 | 155210000 |
11 | 7a680630 |
12 | 43b90728 |
13 | 2620444a |
14 | 168835a8 |
15 | d95d235 |
hex | 9405110 |
155210000 has 200 divisors, whose sum is σ = 439284384. Its totient is φ = 52480000.
The previous prime is 155209987. The next prime is 155210057. The reversal of 155210000 is 12551.
It is a tau number, because it is divible by the number of its divisors (200).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1869959 + ... + 1870041.
Almost surely, 2155210000 is an apocalyptic number.
155210000 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 155210000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219642192).
155210000 is an abundant number, since it is smaller than the sum of its proper divisors (284074384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155210000 is a wasteful number, since it uses less digits than its factorization.
155210000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139 (or 118 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 14.
The square root of 155210000 is about 12458.3305462650. The cubic root of 155210000 is about 537.4110182609.
Adding to 155210000 its reverse (12551), we get a palindrome (155222551).
The spelling of 155210000 in words is "one hundred fifty-five million, two hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •