Base | Representation |
---|---|
bin | 110000011100101000… |
… | …1010011000101101010 |
3 | 100221112201201012102002 |
4 | 1200321101103011222 |
5 | 3201033223113200 |
6 | 115443443211002 |
7 | 10342131561665 |
oct | 1407121230552 |
9 | 327481635362 |
10 | 104040051050 |
11 | 40139995271 |
12 | 181b6976a62 |
13 | 9a70814cb0 |
14 | 506d83c6dc |
15 | 2a8dc71bd5 |
hex | 183945316a |
104040051050 has 24 divisors (see below), whose sum is σ = 208400226636. Its totient is φ = 38414787840.
The previous prime is 104040051013. The next prime is 104040051079. The reversal of 104040051050 is 50150040401.
104040051050 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 6072929041 + 97967122009 = 77929^2 + 312997^2 .
It is a super-2 number, since 2×1040400510502 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 80030159 + ... + 80031458.
Almost surely, 2104040051050 is an apocalyptic number.
104040051050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104040051050 is an abundant number, since it is smaller than the sum of its proper divisors (104360175586).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104040051050 is a wasteful number, since it uses less digits than its factorization.
104040051050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160061642 (or 160061637 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 20.
Adding to 104040051050 its reverse (50150040401), we get a palindrome (154190091451).
The spelling of 104040051050 in words is "one hundred four billion, forty million, fifty-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •