Base | Representation |
---|---|
bin | 11010010000000011… |
… | …00001100000111101 |
3 | 1100101011221211102111 |
4 | 31020001201200331 |
5 | 212330333321421 |
6 | 10250243254021 |
7 | 1006146512041 |
oct | 151001414075 |
9 | 40334854374 |
10 | 14093260861 |
11 | 5a82307529 |
12 | 289397a311 |
13 | 1437a33114 |
14 | 979a32021 |
15 | 577405ee1 |
hex | 34806183d |
14093260861 has 8 divisors (see below), whose sum is σ = 14171137400. Its totient is φ = 14015434752.
The previous prime is 14093260823. The next prime is 14093260871. The reversal of 14093260861 is 16806239041.
It can be written as a sum of positive squares in 4 ways, for example, as 3644536900 + 10448723961 = 60370^2 + 102219^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-14093260861 is a prime.
It is a super-2 number, since 2×140932608612 (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 (14093260871) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 640165 + ... + 661813.
It is an arithmetic number, because the mean of its divisors is an integer number (1771392175).
Almost surely, 214093260861 is an apocalyptic number.
It is an amenable number.
14093260861 is a deficient number, since it is larger than the sum of its proper divisors (77876539).
14093260861 is a wasteful number, since it uses less digits than its factorization.
14093260861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25215.
The product of its (nonzero) digits is 62208, while the sum is 40.
The spelling of 14093260861 in words is "fourteen billion, ninety-three million, two hundred sixty thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •