Base | Representation |
---|---|
bin | 110011010101001000… |
… | …1111011111110010111 |
3 | 101112112012002120012022 |
4 | 1212222101323332113 |
5 | 3301223114324343 |
6 | 122350041043355 |
7 | 10651425064364 |
oct | 1465221737627 |
9 | 345465076168 |
10 | 110231011223 |
11 | 42826594283 |
12 | 1944418655b |
13 | a519321538 |
14 | 5499b5946b |
15 | 2d0252a568 |
hex | 19aa47bf97 |
110231011223 has 4 divisors (see below), whose sum is σ = 110412611520. Its totient is φ = 110049410928.
The previous prime is 110231011217. The next prime is 110231011273. The reversal of 110231011223 is 322110132011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322110132011 = 290119 ⋅1110269.
It is a cyclic number.
It is not a de Polignac number, because 110231011223 - 24 = 110231011207 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 (110231011273) 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 3 ways as a sum of consecutive naturals, for example, 90799238 + ... + 90800451.
It is an arithmetic number, because the mean of its divisors is an integer number (27603152880).
Almost surely, 2110231011223 is an apocalyptic number.
110231011223 is a deficient number, since it is larger than the sum of its proper divisors (181600297).
110231011223 is an equidigital number, since it uses as much as digits as its factorization.
110231011223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181600296.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 110231011223 its reverse (322110132011), we get a palindrome (432341143234).
The spelling of 110231011223 in words is "one hundred ten billion, two hundred thirty-one million, eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •