Base | Representation |
---|---|
bin | 110011001110100011… |
… | …1010001000001100100 |
3 | 101111221210102121202110 |
4 | 1212131013101001210 |
5 | 3300300042010202 |
6 | 122312110241020 |
7 | 10643103335553 |
oct | 1463507210144 |
9 | 344853377673 |
10 | 110010110052 |
11 | 42722925a27 |
12 | 193a21b6170 |
13 | a4b262989b |
14 | 5478695d9a |
15 | 2cdce4326c |
hex | 199d1d1064 |
110010110052 has 12 divisors (see below), whose sum is σ = 256690256816. Its totient is φ = 36670036680.
The previous prime is 110010110051. The next prime is 110010110101. The reversal of 110010110052 is 250011010011.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 9167509171 = 110010110052 / (1 + 1 + 0 + 0 + 1 + 0 + 1 + 1 + 0 + 0 + 5 + 2).
It is not an unprimeable number, because it can be changed into a prime (110010110051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4583754574 + ... + 4583754597.
Almost surely, 2110010110052 is an apocalyptic number.
110010110052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110010110052 is an abundant number, since it is smaller than the sum of its proper divisors (146680146764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110010110052 is a wasteful number, since it uses less digits than its factorization.
110010110052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9167509178 (or 9167509176 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 12.
Adding to 110010110052 its reverse (250011010011), we get a palindrome (360021120063).
The spelling of 110010110052 in words is "one hundred ten billion, ten million, one hundred ten thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •