Base | Representation |
---|---|
bin | 110011001110111000… |
… | …0110110001011010010 |
3 | 101111222112221101212001 |
4 | 1212131300312023102 |
5 | 3300310334311010 |
6 | 122313140024214 |
7 | 10643265104323 |
oct | 1463560661322 |
9 | 344875841761 |
10 | 110021010130 |
11 | 42728aa0359 |
12 | 193a599206a |
13 | a4b4975035 |
14 | 5479cd244a |
15 | 2cddd97c3a |
hex | 199dc362d2 |
110021010130 has 8 divisors (see below), whose sum is σ = 198037818252. Its totient is φ = 44008404048.
The previous prime is 110021010089. The next prime is 110021010157. The reversal of 110021010130 is 31010120011.
It can be written as a sum of positive squares in 2 ways, for example, as 109953917649 + 67092481 = 331593^2 + 8191^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 11002101013 = 110021010130 / (1 + 1 + 0 + 0 + 2 + 1 + 0 + 1 + 0 + 1 + 3 + 0).
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 3 ways as a sum of consecutive naturals, for example, 5501050497 + ... + 5501050516.
Almost surely, 2110021010130 is an apocalyptic number.
110021010130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110021010130 is a deficient number, since it is larger than the sum of its proper divisors (88016808122).
110021010130 is a wasteful number, since it uses less digits than its factorization.
110021010130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11002101020.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 110021010130 its reverse (31010120011), we get a palindrome (141031130141).
The spelling of 110021010130 in words is "one hundred ten billion, twenty-one million, ten thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •