Base | Representation |
---|---|
bin | 110011010001001… |
… | …001011100011110 |
3 | 2012221111021212100 |
4 | 303101021130132 |
5 | 3230143230100 |
6 | 221203345530 |
7 | 30213003552 |
oct | 6321113436 |
9 | 2187437770 |
10 | 860133150 |
11 | 401582848 |
12 | 2000822a6 |
13 | 109278636 |
14 | 8233d862 |
15 | 507a4400 |
hex | 3344971e |
860133150 has 72 divisors (see below), whose sum is σ = 2338834680. Its totient is φ = 226595520.
The previous prime is 860133107. The next prime is 860133163. The reversal of 860133150 is 51331068.
860133150 is a `hidden beast` number, since 8 + 601 + 3 + 3 + 1 + 50 = 666.
860133150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 25836 + ... + 48864.
It is an arithmetic number, because the mean of its divisors is an integer number (32483815).
Almost surely, 2860133150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 860133150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1169417340).
860133150 is an abundant number, since it is smaller than the sum of its proper divisors (1478701530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
860133150 is a wasteful number, since it uses less digits than its factorization.
860133150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23130 (or 23122 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 860133150 is about 29328.0266980239. The cubic root of 860133150 is about 951.0176168590.
The spelling of 860133150 in words is "eight hundred sixty million, one hundred thirty-three thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •