Base | Representation |
---|---|
bin | 110011010111100101… |
… | …0110010000000000001 |
3 | 101112201220102010001210 |
4 | 1212233022302000001 |
5 | 3301410113141231 |
6 | 122402130520333 |
7 | 10653442132260 |
oct | 1465712620001 |
9 | 345656363053 |
10 | 110313021441 |
11 | 42868908817 |
12 | 194677360a9 |
13 | a5303068ac |
14 | 54a69c65d7 |
15 | 2d09829a46 |
hex | 19af2b2001 |
110313021441 has 8 divisors (see below), whose sum is σ = 168096032704. Its totient is φ = 63036012240.
The previous prime is 110313021431. The next prime is 110313021449. The reversal of 110313021441 is 144120313011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110313021441 - 213 = 110313013249 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 5253001021 = 110313021441 / (1 + 1 + 0 + 3 + 1 + 3 + 0 + 2 + 1 + 4 + 4 + 1).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (110313021449) 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, 2626500490 + ... + 2626500531.
It is an arithmetic number, because the mean of its divisors is an integer number (21012004088).
Almost surely, 2110313021441 is an apocalyptic number.
It is an amenable number.
110313021441 is a deficient number, since it is larger than the sum of its proper divisors (57783011263).
110313021441 is an equidigital number, since it uses as much as digits as its factorization.
110313021441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5253001031.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 110313021441 its reverse (144120313011), we get a palindrome (254433334452).
The spelling of 110313021441 in words is "one hundred ten billion, three hundred thirteen million, twenty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •