Base | Representation |
---|---|
bin | 11010010001001011… |
… | …10010111000010101 |
3 | 1100101211211220101012 |
4 | 31020211302320111 |
5 | 212340302103143 |
6 | 10251223142005 |
7 | 1006323363053 |
oct | 151045627025 |
9 | 40354756335 |
10 | 14102769173 |
11 | 5a87711239 |
12 | 2896ba4905 |
13 | 14399b1c3c |
14 | 97adc91d3 |
15 | 578183418 |
hex | 348972e15 |
14102769173 has 4 divisors (see below), whose sum is σ = 14122887948. Its totient is φ = 14082650400.
The previous prime is 14102769143. The next prime is 14102769251. The reversal of 14102769173 is 37196720141.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 37196720141 = 7 ⋅5313817163.
It can be written as a sum of positive squares in 2 ways, for example, as 6931728049 + 7171041124 = 83257^2 + 84682^2 .
It is a cyclic number.
It is not a de Polignac number, because 14102769173 - 214 = 14102752789 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14102769173.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14102769103) 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, 10058336 + ... + 10059737.
It is an arithmetic number, because the mean of its divisors is an integer number (3530721987).
Almost surely, 214102769173 is an apocalyptic number.
It is an amenable number.
14102769173 is a deficient number, since it is larger than the sum of its proper divisors (20118775).
14102769173 is an equidigital number, since it uses as much as digits as its factorization.
14102769173 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20118774.
The product of its (nonzero) digits is 63504, while the sum is 41.
The spelling of 14102769173 in words is "fourteen billion, one hundred two million, seven hundred sixty-nine thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •