Base | Representation |
---|---|
bin | 11010011101111111… |
… | …01100011010011111 |
3 | 1100200100001001120102 |
4 | 31032333230122133 |
5 | 213100304043402 |
6 | 10310022211315 |
7 | 1012066614602 |
oct | 151677543237 |
9 | 40610031512 |
10 | 14210221727 |
11 | 60323329a9 |
12 | 2906b83b3b |
13 | 1456034930 |
14 | 98b39a339 |
15 | 58280b102 |
hex | 34efec69f |
14210221727 has 8 divisors (see below), whose sum is σ = 15318992976. Its totient is φ = 13103690112.
The previous prime is 14210221703. The next prime is 14210221741. The reversal of 14210221727 is 72712201241.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14210221727 - 212 = 14210217631 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 14210221727.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14210221787) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 546713 + ... + 572114.
It is an arithmetic number, because the mean of its divisors is an integer number (1914874122).
Almost surely, 214210221727 is an apocalyptic number.
14210221727 is a deficient number, since it is larger than the sum of its proper divisors (1108771249).
14210221727 is a wasteful number, since it uses less digits than its factorization.
14210221727 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1119817.
The product of its (nonzero) digits is 3136, while the sum is 29.
Adding to 14210221727 its reverse (72712201241), we get a palindrome (86922422968).
The spelling of 14210221727 in words is "fourteen billion, two hundred ten million, two hundred twenty-one thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •