Base | Representation |
---|---|
bin | 100010010110101001110101… |
… | …001110010010110100110000 |
3 | 201210222002112121121121212010 |
4 | 202112221311032102310300 |
5 | 124300430442003020310 |
6 | 1253201534311002520 |
7 | 43552626063542052 |
oct | 4226516516226460 |
9 | 653862477547763 |
10 | 151090326220080 |
11 | 44162058264215 |
12 | 14b42398669440 |
13 | 663c9ab405150 |
14 | 2944b4cbdb8d2 |
15 | 12703159b0320 |
hex | 896a75392d30 |
151090326220080 has 320 divisors, whose sum is σ = 534117887267328. Its totient is φ = 35001273139200.
The previous prime is 151090326220013. The next prime is 151090326220189. The reversal of 151090326220080 is 80022623090151.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 818155755 + ... + 818340405.
Almost surely, 2151090326220080 is an apocalyptic number.
151090326220080 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 151090326220080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (267058943633664).
151090326220080 is an abundant number, since it is smaller than the sum of its proper divisors (383027561047248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151090326220080 is a wasteful number, since it uses less digits than its factorization.
151090326220080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200124 (or 200118 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 39.
The spelling of 151090326220080 in words is "one hundred fifty-one trillion, ninety billion, three hundred twenty-six million, two hundred twenty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •