Base | Representation |
---|---|
bin | 1100110000001001011111… |
… | …1111101010010101001111 |
3 | 1211122102111010110221101201 |
4 | 3030002113333222111033 |
5 | 3314211132231132343 |
6 | 45453150151250331 |
7 | 2645002314416326 |
oct | 314022777522517 |
9 | 54572433427351 |
10 | 14021323302223 |
11 | 4516456518206 |
12 | 16a55149799a7 |
13 | 7a9288835043 |
14 | 3668c83bd0bd |
15 | 194ad7e0d94d |
hex | cc097fea54f |
14021323302223 has 4 divisors (see below), whose sum is σ = 14066119862608. Its totient is φ = 13976526741840.
The previous prime is 14021323302157. The next prime is 14021323302269. The reversal of 14021323302223 is 32220332312041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14021323302223 - 213 = 14021323294031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14021323302191 and 14021323302200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14021323300223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22398279723 + ... + 22398280348.
It is an arithmetic number, because the mean of its divisors is an integer number (3516529965652).
Almost surely, 214021323302223 is an apocalyptic number.
14021323302223 is a deficient number, since it is larger than the sum of its proper divisors (44796560385).
14021323302223 is an equidigital number, since it uses as much as digits as its factorization.
14021323302223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44796560384.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 14021323302223 its reverse (32220332312041), we get a palindrome (46241655614264).
The spelling of 14021323302223 in words is "fourteen trillion, twenty-one billion, three hundred twenty-three million, three hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •