Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0010010001101101000 |
3 | 101112012001122001011110 |
4 | 1212202132102031220 |
5 | 3300441101432222 |
6 | 122325041430320 |
7 | 10645244550006 |
oct | 1464236221550 |
9 | 345161561143 |
10 | 110100030312 |
11 | 42769662398 |
12 | 1940833b3a0 |
13 | a4c815143c |
14 | 54865c1a76 |
15 | 2ce5ca630c |
hex | 19a2792368 |
110100030312 has 64 divisors (see below), whose sum is σ = 276150948480. Its totient is φ = 36580015872.
The previous prime is 110100030283. The next prime is 110100030319. The reversal of 110100030312 is 213030001011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (110100030319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24105453 + ... + 24110019.
It is an arithmetic number, because the mean of its divisors is an integer number (4314858570).
Almost surely, 2110100030312 is an apocalyptic number.
110100030312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110100030312 is an abundant number, since it is smaller than the sum of its proper divisors (166050918168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110100030312 is a wasteful number, since it uses less digits than its factorization.
110100030312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7642 (or 7638 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 110100030312 its reverse (213030001011), we get a palindrome (323130031323).
The spelling of 110100030312 in words is "one hundred ten billion, one hundred million, thirty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •