Base | Representation |
---|---|
bin | 110011001110101010… |
… | …0001101111000011010 |
3 | 101111222000211002211010 |
4 | 1212131110031320122 |
5 | 3300301424130200 |
6 | 122312311114350 |
7 | 10643144235531 |
oct | 1463524157032 |
9 | 344860732733 |
10 | 110013505050 |
11 | 42724834709 |
12 | 193a33729b6 |
13 | a4b3247c67 |
14 | 5478cdb318 |
15 | 2cdd3b4150 |
hex | 199d50de1a |
110013505050 has 48 divisors (see below), whose sum is σ = 288882528192. Its totient is φ = 27611232000.
The previous prime is 110013505037. The next prime is 110013505081. The reversal of 110013505050 is 50505310011.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21568726 + ... + 21573825.
It is an arithmetic number, because the mean of its divisors is an integer number (6018386004).
Almost surely, 2110013505050 is an apocalyptic number.
110013505050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110013505050 is an abundant number, since it is smaller than the sum of its proper divisors (178869023142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110013505050 is a wasteful number, since it uses less digits than its factorization.
110013505050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43142583 (or 43142578 counting only the distinct ones).
The product of its (nonzero) digits is 375, while the sum is 21.
Adding to 110013505050 its reverse (50505310011), we get a palindrome (160518815061).
The spelling of 110013505050 in words is "one hundred ten billion, thirteen million, five hundred five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •