Base | Representation |
---|---|
bin | 101111001000111001… |
… | …011111101111001000 |
3 | 11211122110100022112200 |
4 | 233020321133233020 |
5 | 1312124434440111 |
6 | 35130254240200 |
7 | 3441201503322 |
oct | 571071375710 |
9 | 154573308480 |
10 | 50615155656 |
11 | 1a513a3265a |
12 | 9986ab6060 |
13 | 4a08343a60 |
14 | 2642300612 |
15 | 14b38a8256 |
hex | bc8e5fbc8 |
50615155656 has 96 divisors (see below), whose sum is σ = 147922407360. Its totient is φ = 15542787456.
The previous prime is 50615155651. The next prime is 50615155663. The reversal of 50615155656 is 65655151605.
It is a super-2 number, since 2×506151556562 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (50615155651) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 417055 + ... + 524561.
It is an arithmetic number, because the mean of its divisors is an integer number (1540858410).
Almost surely, 250615155656 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50615155656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73961203680).
50615155656 is an abundant number, since it is smaller than the sum of its proper divisors (97307251704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50615155656 is a wasteful number, since it uses less digits than its factorization.
50615155656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108035 (or 108028 counting only the distinct ones).
The product of its (nonzero) digits is 675000, while the sum is 45.
The spelling of 50615155656 in words is "fifty billion, six hundred fifteen million, one hundred fifty-five thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •