Base | Representation |
---|---|
bin | 10000000001100110100… |
… | …010110100100111011111 |
3 | 10220021110202100111012211 |
4 | 100001212202310213133 |
5 | 121020310400012343 |
6 | 2201522104141251 |
7 | 142363361554141 |
oct | 20014642644737 |
9 | 3807422314184 |
10 | 1101232032223 |
11 | 395036856044 |
12 | 159514467827 |
13 | 7cacc10671b |
14 | 3b42ad74c91 |
15 | 1d9a3c1779d |
hex | 100668b49df |
1101232032223 has 16 divisors (see below), whose sum is σ = 1145897280000. Its totient is φ = 1057517364960.
The previous prime is 1101232032209. The next prime is 1101232032239. The reversal of 1101232032223 is 3222302321011.
It is a cyclic number.
It is not a de Polignac number, because 1101232032223 - 225 = 1101198477791 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101232032194 and 1101232032203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101232032023) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 593653 + ... + 1598401.
It is an arithmetic number, because the mean of its divisors is an integer number (71618580000).
Almost surely, 21101232032223 is an apocalyptic number.
1101232032223 is a deficient number, since it is larger than the sum of its proper divisors (44665247777).
1101232032223 is a wasteful number, since it uses less digits than its factorization.
1101232032223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1005222.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 1101232032223 its reverse (3222302321011), we get a palindrome (4323534353234).
The spelling of 1101232032223 in words is "one trillion, one hundred one billion, two hundred thirty-two million, thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •