Base | Representation |
---|---|
bin | 11010100011011001… |
… | …01010110110001001 |
3 | 1100210111100210111222 |
4 | 31101230222312021 |
5 | 213143411104332 |
6 | 10314322131425 |
7 | 1013160212354 |
oct | 152154526611 |
9 | 40714323458 |
10 | 14255566217 |
11 | 6055993992 |
12 | 291a1b0b75 |
13 | 146254cca9 |
14 | 99340129b |
15 | 5867b6712 |
hex | 351b2ad89 |
14255566217 has 8 divisors (see below), whose sum is σ = 14803310760. Its totient is φ = 13717347840.
The previous prime is 14255566159. The next prime is 14255566229. The reversal of 14255566217 is 71266555241.
14255566217 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 819047161 + 13436519056 = 28619^2 + 115916^2 .
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 14255566217 - 210 = 14255565193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (14255566817) 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 in 7 ways as a sum of consecutive naturals, for example, 2378492 + ... + 2384477.
It is an arithmetic number, because the mean of its divisors is an integer number (1850413845).
Almost surely, 214255566217 is an apocalyptic number.
It is an amenable number.
14255566217 is a deficient number, since it is larger than the sum of its proper divisors (547744543).
14255566217 is an equidigital number, since it uses as much as digits as its factorization.
14255566217 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4763083.
The product of its digits is 504000, while the sum is 44.
The spelling of 14255566217 in words is "fourteen billion, two hundred fifty-five million, five hundred sixty-six thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •