Base | Representation |
---|---|
bin | 11010010001110110… |
… | …10010011000011011 |
3 | 1100102020110010211212 |
4 | 31020323102120123 |
5 | 212343222400402 |
6 | 10251544013335 |
7 | 1006422306632 |
oct | 151073223033 |
9 | 40366403755 |
10 | 14108403227 |
11 | 5a8a90a186 |
12 | 2898a6124b |
13 | 143ac054b9 |
14 | 97ba54519 |
15 | 5788e7952 |
hex | 348ed261b |
14108403227 has 12 divisors (see below), whose sum is σ = 14623184160. Its totient is φ = 13611179232.
The previous prime is 14108403209. The next prime is 14108403233. The reversal of 14108403227 is 72230480141.
14108403227 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14108403227 - 226 = 14041294363 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14108403193 and 14108403202.
It is not an unprimeable number, because it can be changed into a prime (14108408227) 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 11 ways as a sum of consecutive naturals, for example, 1190849 + ... + 1202637.
It is an arithmetic number, because the mean of its divisors is an integer number (1218598680).
Almost surely, 214108403227 is an apocalyptic number.
14108403227 is a deficient number, since it is larger than the sum of its proper divisors (514780933).
14108403227 is a wasteful number, since it uses less digits than its factorization.
14108403227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13270 (or 13241 counting only the distinct ones).
The product of its (nonzero) digits is 10752, while the sum is 32.
Adding to 14108403227 its reverse (72230480141), we get a palindrome (86338883368).
The spelling of 14108403227 in words is "fourteen billion, one hundred eight million, four hundred three thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •