Base | Representation |
---|---|
bin | 11010011000010011… |
… | …01110111100000101 |
3 | 1100120000021122122201 |
4 | 31030021232330011 |
5 | 213001101144421 |
6 | 10301155554501 |
7 | 1010650310125 |
oct | 151411567405 |
9 | 40500248581 |
10 | 14162521861 |
11 | 6008413324 |
12 | 28b2bbba31 |
13 | 14491a3467 |
14 | 984d00c85 |
15 | 57d537b91 |
hex | 34c26ef05 |
14162521861 has 2 divisors, whose sum is σ = 14162521862. Its totient is φ = 14162521860.
The previous prime is 14162521847. The next prime is 14162521871. The reversal of 14162521861 is 16812526141.
14162521861 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12705572961 + 1456948900 = 112719^2 + 38170^2 .
It is a cyclic number.
It is not a de Polignac number, because 14162521861 - 219 = 14161997573 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14162521861.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14162521811) 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, 7081260930 + 7081260931.
It is an arithmetic number, because the mean of its divisors is an integer number (7081260931).
Almost surely, 214162521861 is an apocalyptic number.
It is an amenable number.
14162521861 is a deficient number, since it is larger than the sum of its proper divisors (1).
14162521861 is an equidigital number, since it uses as much as digits as its factorization.
14162521861 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 23040, while the sum is 37.
The spelling of 14162521861 in words is "fourteen billion, one hundred sixty-two million, five hundred twenty-one thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •