Base | Representation |
---|---|
bin | 11010011001100101… |
… | …11000000011011101 |
3 | 1100120202120121020001 |
4 | 31030302320003131 |
5 | 213011331311401 |
6 | 10302223054301 |
7 | 1011141060022 |
oct | 151462700335 |
9 | 40522517201 |
10 | 14173307101 |
11 | 601350a448 |
12 | 28b6741391 |
13 | 144b4ab565 |
14 | 98650b549 |
15 | 57e468601 |
hex | 34ccb80dd |
14173307101 has 2 divisors, whose sum is σ = 14173307102. Its totient is φ = 14173307100.
The previous prime is 14173307081. The next prime is 14173307177. The reversal of 14173307101 is 10170337141.
14173307101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10980944100 + 3192363001 = 104790^2 + 56501^2 .
It is a cyclic number.
It is not a de Polignac number, because 14173307101 - 227 = 14039089373 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14173307101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14173347101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7086653550 + 7086653551.
It is an arithmetic number, because the mean of its divisors is an integer number (7086653551).
Almost surely, 214173307101 is an apocalyptic number.
It is an amenable number.
14173307101 is a deficient number, since it is larger than the sum of its proper divisors (1).
14173307101 is an equidigital number, since it uses as much as digits as its factorization.
14173307101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1764, while the sum is 28.
The spelling of 14173307101 in words is "fourteen billion, one hundred seventy-three million, three hundred seven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •