Base | Representation |
---|---|
bin | 11010010001011111… |
… | …10001111010100101 |
3 | 1100102000202212220012 |
4 | 31020233301322211 |
5 | 212341434333121 |
6 | 10251355220005 |
7 | 1006354544162 |
oct | 151057617245 |
9 | 40360685805 |
10 | 14105386661 |
11 | 5a89139853 |
12 | 2897a47605 |
13 | 143a3ba452 |
14 | 97b4ab069 |
15 | 5784edc5b |
hex | 348bf1ea5 |
14105386661 has 8 divisors (see below), whose sum is σ = 14505654744. Its totient is φ = 13707796480.
The previous prime is 14105386613. The next prime is 14105386681. The reversal of 14105386661 is 16668350141.
It can be written as a sum of positive squares in 4 ways, for example, as 7707786436 + 6397600225 = 87794^2 + 79985^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14105386661 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14105386681) 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 7 ways as a sum of consecutive naturals, for example, 658790 + ... + 679863.
It is an arithmetic number, because the mean of its divisors is an integer number (1813206843).
Almost surely, 214105386661 is an apocalyptic number.
It is an amenable number.
14105386661 is a deficient number, since it is larger than the sum of its proper divisors (400268083).
14105386661 is a wasteful number, since it uses less digits than its factorization.
14105386661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1338951.
The product of its (nonzero) digits is 103680, while the sum is 41.
The spelling of 14105386661 in words is "fourteen billion, one hundred five million, three hundred eighty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •