Base | Representation |
---|---|
bin | 110011010101001011… |
… | …0100110000001100001 |
3 | 101112112021101120211111 |
4 | 1212222112212001201 |
5 | 3301223422411113 |
6 | 122350123143321 |
7 | 10651441340530 |
oct | 1465226460141 |
9 | 345467346744 |
10 | 110232232033 |
11 | 42827248510 |
12 | 19444674b41 |
13 | a51965b101 |
14 | 5499d96317 |
15 | 2d026bc13d |
hex | 19aa5a6061 |
110232232033 has 32 divisors (see below), whose sum is σ = 140568145920. Its totient is φ = 83940917760.
The previous prime is 110232232013. The next prime is 110232232049. The reversal of 110232232033 is 330232232011.
It is a de Polignac number, because none of the positive numbers 2k-110232232033 is a prime.
It is a super-2 number, since 2×1102322320332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110232231995 and 110232232013.
It is not an unprimeable number, because it can be changed into a prime (110232232003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2412958 + ... + 2458216.
It is an arithmetic number, because the mean of its divisors is an integer number (4392754560).
Almost surely, 2110232232033 is an apocalyptic number.
It is an amenable number.
110232232033 is a deficient number, since it is larger than the sum of its proper divisors (30335913887).
110232232033 is a wasteful number, since it uses less digits than its factorization.
110232232033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45997.
The product of its (nonzero) digits is 1296, while the sum is 22.
Subtracting from 110232232033 its sum of digits (22), we obtain a palindrome (110232232011).
Adding to 110232232033 its reverse (330232232011), we get a palindrome (440464464044).
The spelling of 110232232033 in words is "one hundred ten billion, two hundred thirty-two million, two hundred thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •