Base | Representation |
---|---|
bin | 11001000101000111111101… |
… | …100111001010010100110100 |
3 | 112110112220010022212202120210 |
4 | 121011013331213022110310 |
5 | 103424202134331431012 |
6 | 1030332350250225420 |
7 | 32143102564320642 |
oct | 3105077547122464 |
9 | 473486108782523 |
10 | 110303310030132 |
11 | 32167409a0208a |
12 | 1045562b425270 |
13 | 4971732ab487b |
14 | 1d349cc910192 |
15 | cb43977a623c |
hex | 6451fd9ca534 |
110303310030132 has 48 divisors (see below), whose sum is σ = 258026310940160. Its totient is φ = 36674641060992.
The previous prime is 110303310030103. The next prime is 110303310030143. The reversal of 110303310030132 is 231030013303011.
It is a junction number, because it is equal to n+sod(n) for n = 110303310030099 and 110303310030108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 502001469 + ... + 502221147.
Almost surely, 2110303310030132 is an apocalyptic number.
110303310030132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110303310030132 is an abundant number, since it is smaller than the sum of its proper divisors (147723000910028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110303310030132 is a wasteful number, since it uses less digits than its factorization.
110303310030132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 325480 (or 325478 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 110303310030132 its reverse (231030013303011), we get a palindrome (341333323333143).
The spelling of 110303310030132 in words is "one hundred ten trillion, three hundred three billion, three hundred ten million, thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •