Base | Representation |
---|---|
bin | 11010010010111110… |
… | …00000111110000101 |
3 | 1100102220001222101210 |
4 | 31021133000332011 |
5 | 212403122102333 |
6 | 10252520442033 |
7 | 1006565025441 |
oct | 151137007605 |
9 | 40386058353 |
10 | 14117769093 |
11 | 5a9512696a |
12 | 28a0019319 |
13 | 143cb3452c |
14 | 97cdb1821 |
15 | 579647a63 |
hex | 3497c0f85 |
14117769093 has 8 divisors (see below), whose sum is σ = 18824265568. Its totient is φ = 9411559344.
The previous prime is 14117769089. The next prime is 14117769103. The reversal of 14117769093 is 39096771141.
14117769093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14117769093 - 22 = 14117769089 is a prime.
It is a super-2 number, since 2×141177690932 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14117769793) 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, 106446 + ... + 198912.
It is an arithmetic number, because the mean of its divisors is an integer number (2353033196).
Almost surely, 214117769093 is an apocalyptic number.
It is an amenable number.
14117769093 is a deficient number, since it is larger than the sum of its proper divisors (4706496475).
14117769093 is an equidigital number, since it uses as much as digits as its factorization.
14117769093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143363.
The product of its (nonzero) digits is 285768, while the sum is 48.
The spelling of 14117769093 in words is "fourteen billion, one hundred seventeen million, seven hundred sixty-nine thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •