Base | Representation |
---|---|
bin | 1000000000110111… |
… | …1111001000110100 |
3 | 12112220202202020010 |
4 | 2000031333020310 |
5 | 13401143301012 |
6 | 553242340220 |
7 | 104210321505 |
oct | 20015771064 |
9 | 5486682203 |
10 | 2151150132 |
11 | a042a4a2a |
12 | 5004ba670 |
13 | 283889901 |
14 | 1659a2bac |
15 | c8cbcc3c |
hex | 8037f234 |
2151150132 has 48 divisors (see below), whose sum is σ = 5306333760. Its totient is φ = 676378368.
The previous prime is 2151150103. The next prime is 2151150143. The reversal of 2151150132 is 2310511512.
It is a junction number, because it is equal to n+sod(n) for n = 2151150099 and 2151150108.
It is a congruent number.
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, 32878 + ... + 73370.
It is an arithmetic number, because the mean of its divisors is an integer number (110548620).
Almost surely, 22151150132 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 2151150132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2653166880).
2151150132 is an abundant number, since it is smaller than the sum of its proper divisors (3155183628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2151150132 is a wasteful number, since it uses less digits than its factorization.
2151150132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40752 (or 40750 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 21.
The square root of 2151150132 is about 46380.4930116100. The cubic root of 2151150132 is about 1290.8929842496.
Adding to 2151150132 its reverse (2310511512), we get a palindrome (4461661644).
The spelling of 2151150132 in words is "two billion, one hundred fifty-one million, one hundred fifty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •