Base | Representation |
---|---|
bin | 110011010100111010… |
… | …0001110111001101111 |
3 | 101112111122102221201121 |
4 | 1212221310032321233 |
5 | 3301214121140211 |
6 | 122345202121411 |
7 | 10651301643355 |
oct | 1465164167157 |
9 | 345448387647 |
10 | 110223224431 |
11 | 42822155a11 |
12 | 19441650267 |
13 | a517826178 |
14 | 5498acd7d5 |
15 | 2d019dd271 |
hex | 19a9d0ee6f |
110223224431 has 8 divisors (see below), whose sum is σ = 111627648000. Its totient is φ = 108819030840.
The previous prime is 110223224383. The next prime is 110223224437. The reversal of 110223224431 is 134422322011.
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 110223224431 - 27 = 110223224303 is a prime.
It is a super-2 number, since 2×1102232244312 (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 = 110223224396 and 110223224405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110223224437) 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, 1039566 + ... + 1140676.
It is an arithmetic number, because the mean of its divisors is an integer number (13953456000).
Almost surely, 2110223224431 is an apocalyptic number.
110223224431 is a deficient number, since it is larger than the sum of its proper divisors (1404423569).
110223224431 is a wasteful number, since it uses less digits than its factorization.
110223224431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114989.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 110223224431 its reverse (134422322011), we get a palindrome (244645546442).
The spelling of 110223224431 in words is "one hundred ten billion, two hundred twenty-three million, two hundred twenty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •