Base | Representation |
---|---|
bin | 11001000101011010011011… |
… | …000110011001100010110110 |
3 | 112110121210021202121210201011 |
4 | 121011122123012121202312 |
5 | 103430013233310023110 |
6 | 1030345425222222434 |
7 | 32144404026244156 |
oct | 3105323306314266 |
9 | 473553252553634 |
10 | 110323132111030 |
11 | 32174860a5a923 |
12 | 10459441884a1a |
13 | 4973571666817 |
14 | 1d3594d320766 |
15 | cb4b57aca48a |
hex | 64569b1998b6 |
110323132111030 has 16 divisors (see below), whose sum is σ = 200509614867744. Its totient is φ = 43700813496000.
The previous prime is 110323132111021. The next prime is 110323132111069. The reversal of 110323132111030 is 30111231323011.
It is a junction number, because it is equal to n+sod(n) for n = 110323132110992 and 110323132111010.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53554917471 + ... + 53554919530.
It is an arithmetic number, because the mean of its divisors is an integer number (12531850929234).
Almost surely, 2110323132111030 is an apocalyptic number.
110323132111030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110323132111030 is a deficient number, since it is larger than the sum of its proper divisors (90186482756714).
110323132111030 is a wasteful number, since it uses less digits than its factorization.
110323132111030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107109837111.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 110323132111030 its reverse (30111231323011), we get a palindrome (140434363434041).
The spelling of 110323132111030 in words is "one hundred ten trillion, three hundred twenty-three billion, one hundred thirty-two million, one hundred eleven thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •