Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0101010100011101110 |
3 | 101112012001211002221201 |
4 | 1212202132222203232 |
5 | 3300441113130110 |
6 | 122325043520114 |
7 | 10645245443512 |
oct | 1464236524356 |
9 | 345161732851 |
10 | 110100130030 |
11 | 42769720300 |
12 | 1940838903a |
13 | a4c8187947 |
14 | 548660a142 |
15 | 2ce5cc5b3a |
hex | 19a27aa8ee |
110100130030 has 48 divisors (see below), whose sum is σ = 223721981280. Its totient is φ = 38954329920.
The previous prime is 110100130009. The next prime is 110100130037. The reversal of 110100130030 is 30031001011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 110100129989 and 110100130016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110100130037) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1184850 + ... + 1274389.
It is an arithmetic number, because the mean of its divisors is an integer number (4660874610).
Almost surely, 2110100130030 is an apocalyptic number.
110100130030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110100130030 is an abundant number, since it is smaller than the sum of its proper divisors (113621851250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110100130030 is a wasteful number, since it uses less digits than its factorization.
110100130030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2459305 (or 2459294 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 10.
Adding to 110100130030 its reverse (30031001011), we get a palindrome (140131131041).
The spelling of 110100130030 in words is "one hundred ten billion, one hundred million, one hundred thirty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •