Base | Representation |
---|---|
bin | 1001000011010110110… |
… | …1000000110101001110 |
3 | 112212102102222011112210 |
4 | 2100311231000311032 |
5 | 10022001033034430 |
6 | 155240025211250 |
7 | 14143632421221 |
oct | 2206555006516 |
9 | 485372864483 |
10 | 155519814990 |
11 | 5aa56976921 |
12 | 26183330b26 |
13 | 11886010287 |
14 | 77548c55b8 |
15 | 40a34b52b0 |
hex | 2435b40d4e |
155519814990 has 32 divisors (see below), whose sum is σ = 375624940320. Its totient is φ = 41207796864.
The previous prime is 155519814971. The next prime is 155519815027. The reversal of 155519814990 is 99418915551.
It is a self number, because there is not a number n which added to its sum of digits gives 155519814990.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16504825 + ... + 16514244.
It is an arithmetic number, because the mean of its divisors is an integer number (11738279385).
Almost surely, 2155519814990 is an apocalyptic number.
155519814990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
155519814990 is an abundant number, since it is smaller than the sum of its proper divisors (220105125330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155519814990 is a wasteful number, since it uses less digits than its factorization.
155519814990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33019236.
The product of its (nonzero) digits is 2916000, while the sum is 57.
The spelling of 155519814990 in words is "one hundred fifty-five billion, five hundred nineteen million, eight hundred fourteen thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •