Base | Representation |
---|---|
bin | 101101111011000… |
… | …0001001001101110 |
3 | 10222101110011210110 |
4 | 1123312001021232 |
5 | 11123431342100 |
6 | 412522320450 |
7 | 53120216235 |
oct | 13366011156 |
9 | 3871404713 |
10 | 1540887150 |
11 | 720877360 |
12 | 370059126 |
13 | 1b730985a |
14 | 108907b1c |
15 | 90424250 |
hex | 5bd8126e |
1540887150 has 96 divisors (see below), whose sum is σ = 4179875328. Its totient is φ = 372556800.
The previous prime is 1540887143. The next prime is 1540887167. The reversal of 1540887150 is 517880451.
It is a junction number, because it is equal to n+sod(n) for n = 1540887099 and 1540887108.
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, 762942 + ... + 764958.
It is an arithmetic number, because the mean of its divisors is an integer number (43540368).
Almost surely, 21540887150 is an apocalyptic number.
1540887150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1540887150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2089937664).
1540887150 is an abundant number, since it is smaller than the sum of its proper divisors (2638988178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1540887150 is a wasteful number, since it uses less digits than its factorization.
1540887150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2506 (or 2501 counting only the distinct ones).
The product of its (nonzero) digits is 44800, while the sum is 39.
The square root of 1540887150 is about 39254.1354509305. The cubic root of 1540887150 is about 1155.0220568866.
The spelling of 1540887150 in words is "one billion, five hundred forty million, eight hundred eighty-seven thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •