Base | Representation |
---|---|
bin | 1010010011011110… |
… | …11010111011101110 |
3 | 112021112200120202110 |
4 | 11021233122323232 |
5 | 42312211311100 |
6 | 2312540504450 |
7 | 254043241623 |
oct | 51157327356 |
9 | 15245616673 |
10 | 5532135150 |
11 | 2389823023 |
12 | 10a484b126 |
13 | 6a2185769 |
14 | 3a6a2034a |
15 | 225a1b250 |
hex | 149bdaeee |
5532135150 has 96 divisors (see below), whose sum is σ = 13926751488. Its totient is φ = 1453132800.
The previous prime is 5532135131. The next prime is 5532135211. The reversal of 5532135150 is 515312355.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 3259102 + ... + 3260798.
It is an arithmetic number, because the mean of its divisors is an integer number (145070328).
Almost surely, 25532135150 is an apocalyptic number.
5532135150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 5532135150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6963375744).
5532135150 is an abundant number, since it is smaller than the sum of its proper divisors (8394616338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5532135150 is a wasteful number, since it uses less digits than its factorization.
5532135150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2026 (or 2021 counting only the distinct ones).
The product of its (nonzero) digits is 11250, while the sum is 30.
The square root of 5532135150 is about 74378.3244635156. The cubic root of 5532135150 is about 1768.6053203172.
The spelling of 5532135150 in words is "five billion, five hundred thirty-two million, one hundred thirty-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •