Base | Representation |
---|---|
bin | 11010011110110100… |
… | …10011010100110011 |
3 | 1100200211011102122100 |
4 | 31033122103110303 |
5 | 213104100244401 |
6 | 10310431511443 |
7 | 1012213115334 |
oct | 151732232463 |
9 | 40624142570 |
10 | 14217196851 |
11 | 6036267470 |
12 | 2909388583 |
13 | 1457607720 |
14 | 98c29428b |
15 | 583237b86 |
hex | 34f693533 |
14217196851 has 48 divisors (see below), whose sum is σ = 24215772672. Its totient is φ = 7924132800.
The previous prime is 14217196837. The next prime is 14217196871. The reversal of 14217196851 is 15869171241.
It is not a de Polignac number, because 14217196851 - 26 = 14217196787 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14217196797 and 14217196806.
It is not an unprimeable number, because it can be changed into a prime (14217196801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 328396 + ... + 369158.
It is an arithmetic number, because the mean of its divisors is an integer number (504495264).
Almost surely, 214217196851 is an apocalyptic number.
14217196851 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
14217196851 is a deficient number, since it is larger than the sum of its proper divisors (9998575821).
14217196851 is a wasteful number, since it uses less digits than its factorization.
14217196851 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41064 (or 41061 counting only the distinct ones).
The product of its digits is 120960, while the sum is 45.
The spelling of 14217196851 in words is "fourteen billion, two hundred seventeen million, one hundred ninety-six thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •