Base | Representation |
---|---|
bin | 1001000011101110110… |
… | …0000000010010110000 |
3 | 112212200102212222000021 |
4 | 2100323230000102300 |
5 | 10022202233321221 |
6 | 155254013133224 |
7 | 14146261664425 |
oct | 2207354002260 |
9 | 485612788007 |
10 | 155620213936 |
11 | 5aaa8610060 |
12 | 261b0a8a214 |
13 | 118a0a63535 |
14 | 7763d7bd4c |
15 | 40ac1e8041 |
hex | 243bb004b0 |
155620213936 has 80 divisors (see below), whose sum is σ = 339567471648. Its totient is φ = 68467507200.
The previous prime is 155620213901. The next prime is 155620213997. The reversal of 155620213936 is 639312026551.
It is a super-2 number, since 2×1556202139362 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 155620213892 and 155620213901.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1194906 + ... + 1318726.
Almost surely, 2155620213936 is an apocalyptic number.
155620213936 is a gapful number since it is divisible by the number (16) 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 155620213936, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (169783735824).
155620213936 is an abundant number, since it is smaller than the sum of its proper divisors (183947257712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155620213936 is a wasteful number, since it uses less digits than its factorization.
155620213936 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124070 (or 124064 counting only the distinct ones).
The product of its (nonzero) digits is 291600, while the sum is 43.
The spelling of 155620213936 in words is "one hundred fifty-five billion, six hundred twenty million, two hundred thirteen thousand, nine hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •