Base | Representation |
---|---|
bin | 110000000001010000… |
… | …0000100000000000000 |
3 | 100212011200200102210022 |
4 | 1200002200010000000 |
5 | 3142143010041103 |
6 | 115212340353012 |
7 | 10310303343461 |
oct | 1400240040000 |
9 | 325150612708 |
10 | 103121174528 |
11 | 3a80823a789 |
12 | 17b9b0a5768 |
13 | 995533c688 |
14 | 4dc37aad68 |
15 | 2a38267138 |
hex | 1802804000 |
103121174528 has 90 divisors (see below), whose sum is σ = 208635811818. Its totient is φ = 50967347200.
The previous prime is 103121174459. The next prime is 103121174557. The reversal of 103121174528 is 825471121301.
It can be written as a sum of positive squares in 3 ways, for example, as 39923236864 + 63197937664 = 199808^2 + 251392^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 167132876 + ... + 167133492.
Almost surely, 2103121174528 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 103121174528, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (104317905909).
103121174528 is an abundant number, since it is smaller than the sum of its proper divisors (105514637290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103121174528 is an frugal number, since it uses more digits than its factorization.
103121174528 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 847 (or 720 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 35.
Adding to 103121174528 its reverse (825471121301), we get a palindrome (928592295829).
The spelling of 103121174528 in words is "one hundred three billion, one hundred twenty-one million, one hundred seventy-four thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •