Base | Representation |
---|---|
bin | 110011010111111010… |
… | …1001010011001011111 |
3 | 101112202200022120002121 |
4 | 1212233311022121133 |
5 | 3301420434201143 |
6 | 122403205003411 |
7 | 10653635434012 |
oct | 1465765123137 |
9 | 345680276077 |
10 | 110324131423 |
11 | 42874106920 |
12 | 1946b3b3567 |
13 | a5326c674c |
14 | 54a8279379 |
15 | 2d0a7c17ed |
hex | 19afd4a65f |
110324131423 has 8 divisors (see below), whose sum is σ = 120717207936. Its totient is φ = 99991656600.
The previous prime is 110324131417. The next prime is 110324131429. The reversal of 110324131423 is 324131423011.
It is an interprime number because it is at equal distance from previous prime (110324131417) and next prime (110324131429).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110324131423 - 25 = 110324131391 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110324131429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15146611 + ... + 15153892.
It is an arithmetic number, because the mean of its divisors is an integer number (15089650992).
Almost surely, 2110324131423 is an apocalyptic number.
110324131423 is a deficient number, since it is larger than the sum of its proper divisors (10393076513).
110324131423 is a wasteful number, since it uses less digits than its factorization.
110324131423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30300845.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 110324131423 its reverse (324131423011), we get a palindrome (434455554434).
The spelling of 110324131423 in words is "one hundred ten billion, three hundred twenty-four million, one hundred thirty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •