Base | Representation |
---|---|
bin | 1100001101100111… |
… | …01000101010100110 |
3 | 121220221111100010110 |
4 | 12012303220222212 |
5 | 101412000301100 |
6 | 3002335433450 |
7 | 321323415051 |
oct | 60663505246 |
9 | 17827440113 |
10 | 6556650150 |
11 | 2865070336 |
12 | 132b985886 |
13 | 8064c715b |
14 | 462b0da98 |
15 | 285941250 |
hex | 186ce8aa6 |
6556650150 has 96 divisors (see below), whose sum is σ = 17372280960. Its totient is φ = 1631646720.
The previous prime is 6556650143. The next prime is 6556650167. The reversal of 6556650150 is 510566556.
It is a super-2 number, since 2×65566501502 = 85979322378990045000, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6556650099 and 6556650108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 173782 + ... + 208118.
It is an arithmetic number, because the mean of its divisors is an integer number (180961260).
Almost surely, 26556650150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6556650150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8686140480).
6556650150 is an abundant number, since it is smaller than the sum of its proper divisors (10815630810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6556650150 is a wasteful number, since it uses less digits than its factorization.
6556650150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34438 (or 34433 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 39.
The square root of 6556650150 is about 80973.1446221523. The cubic root of 6556650150 is about 1871.6616294558.
The spelling of 6556650150 in words is "six billion, five hundred fifty-six million, six hundred fifty thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •