Base | Representation |
---|---|
bin | 1100110101010100001110… |
… | …1111001110100011100111 |
3 | 1211221220122102001202102111 |
4 | 3031111003233032203213 |
5 | 3322134443112134343 |
6 | 50002031534221451 |
7 | 2654264350161640 |
oct | 315250357164347 |
9 | 54856572052374 |
10 | 14110104021223 |
11 | 4550074963451 |
12 | 16ba771354887 |
13 | 7b4766b71a72 |
14 | 36ad0b3ac6c7 |
15 | 1970821e1c9d |
hex | cd543bce8e7 |
14110104021223 has 8 divisors (see below), whose sum is σ = 16177684723200. Its totient is φ = 12055486208280.
The previous prime is 14110104021217. The next prime is 14110104021241. The reversal of 14110104021223 is 32212040101141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14110104021223 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14110104021194 and 14110104021203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14110104021253) 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, 3240719923 + ... + 3240724276.
It is an arithmetic number, because the mean of its divisors is an integer number (2022210590400).
Almost surely, 214110104021223 is an apocalyptic number.
14110104021223 is a deficient number, since it is larger than the sum of its proper divisors (2067580701977).
14110104021223 is an equidigital number, since it uses as much as digits as its factorization.
14110104021223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6481444517.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 14110104021223 its reverse (32212040101141), we get a palindrome (46322144122364).
The spelling of 14110104021223 in words is "fourteen trillion, one hundred ten billion, one hundred four million, twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •