Base | Representation |
---|---|
bin | 110011010111100011… |
… | …1101100001011000100 |
3 | 101112201211212221112122 |
4 | 1212233013230023010 |
5 | 3301404411224030 |
6 | 122402101305112 |
7 | 10653432216005 |
oct | 1465707541304 |
9 | 345654787478 |
10 | 110312211140 |
11 | 42868404a4a |
12 | 19467405198 |
13 | a5300b1b21 |
14 | 54a68551ac |
15 | 2d097198e5 |
hex | 19af1ec2c4 |
110312211140 has 24 divisors (see below), whose sum is σ = 234829011480. Its totient is φ = 43520433408.
The previous prime is 110312211133. The next prime is 110312211151. The reversal of 110312211140 is 41112213011.
It can be written as a sum of positive squares in 4 ways, for example, as 32033124484 + 78279086656 = 178978^2 + 279784^2 .
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 7 ways as a sum of consecutive naturals, for example, 37776695 + ... + 37779614.
It is an arithmetic number, because the mean of its divisors is an integer number (9784542145).
Almost surely, 2110312211140 is an apocalyptic number.
110312211140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110312211140 is an abundant number, since it is smaller than the sum of its proper divisors (124516800340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110312211140 is a wasteful number, since it uses less digits than its factorization.
110312211140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75556391 (or 75556389 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 110312211140 its reverse (41112213011), we get a palindrome (151424424151).
The spelling of 110312211140 in words is "one hundred ten billion, three hundred twelve million, two hundred eleven thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •