Base | Representation |
---|---|
bin | 110011010010001000… |
… | …0101100101101000001 |
3 | 101112021011001211201101 |
4 | 1212210100230231001 |
5 | 3301021241220413 |
6 | 122332032334401 |
7 | 10646060515636 |
oct | 1464420545501 |
9 | 345234054641 |
10 | 110130023233 |
11 | 4278458852a |
12 | 194163a4401 |
13 | a501423129 |
14 | 548a58c18d |
15 | 2ce872cedd |
hex | 19a442cb41 |
110130023233 has 8 divisors (see below), whose sum is σ = 114117660800. Its totient is φ = 106207225488.
The previous prime is 110130023221. The next prime is 110130023243. The reversal of 110130023233 is 332320031011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110130023233 - 229 = 109593152321 is a prime.
It is a super-2 number, since 2×1101300232332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110130023233.
It is not an unprimeable number, because it can be changed into a prime (110130023243) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16206498 + ... + 16213291.
It is an arithmetic number, because the mean of its divisors is an integer number (14264707600).
Almost surely, 2110130023233 is an apocalyptic number.
It is an amenable number.
110130023233 is a deficient number, since it is larger than the sum of its proper divisors (3987637567).
110130023233 is an equidigital number, since it uses as much as digits as its factorization.
110130023233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32419911.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 110130023233 its reverse (332320031011), we get a palindrome (442450054244).
The spelling of 110130023233 in words is "one hundred ten billion, one hundred thirty million, twenty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •