Base | Representation |
---|---|
bin | 10010100010001… |
… | …00001011010110 |
3 | 101211112121200200 |
4 | 21101010023112 |
5 | 304244443002 |
6 | 23232121330 |
7 | 3565313640 |
oct | 1121041326 |
9 | 354477620 |
10 | 155468502 |
11 | 7a837872 |
12 | 44096246 |
13 | 26294cc7 |
14 | 1690d890 |
15 | d9aeb1c |
hex | 94442d6 |
155468502 has 96 divisors (see below), whose sum is σ = 410889024. Its totient is φ = 41472000.
The previous prime is 155468497. The next prime is 155468531. The reversal of 155468502 is 205864551.
It is a super-3 number, since 3×1554685023 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
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, 387502 + ... + 387902.
It is an arithmetic number, because the mean of its divisors is an integer number (4280094).
Almost surely, 2155468502 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 155468502, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (205444512).
155468502 is an abundant number, since it is smaller than the sum of its proper divisors (255420522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155468502 is a wasteful number, since it uses less digits than its factorization.
155468502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 614 (or 611 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 36.
The square root of 155468502 is about 12468.7008946401. The cubic root of 155468502 is about 537.7092051682.
The spelling of 155468502 in words is "one hundred fifty-five million, four hundred sixty-eight thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •