Base | Representation |
---|---|
bin | 11010000101101010… |
… | …00100001000100011 |
3 | 1100011002222001010221 |
4 | 31002311010020203 |
5 | 212141030434312 |
6 | 10233451303511 |
7 | 1004040650113 |
oct | 150265041043 |
9 | 40132861127 |
10 | 14006108707 |
11 | 5a380a0858 |
12 | 286a74ab97 |
13 | 142296a4b6 |
14 | 96c227043 |
15 | 56e93d207 |
hex | 342d44223 |
14006108707 has 4 divisors (see below), whose sum is σ = 14243500440. Its totient is φ = 13768716976.
The previous prime is 14006108693. The next prime is 14006108731. The reversal of 14006108707 is 70780160041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 70780160041 = 2621 ⋅27005021.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14006108707 is a prime.
It is a super-2 number, since 2×140061087072 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14006108777) 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 3 ways as a sum of consecutive naturals, for example, 118695778 + ... + 118695895.
It is an arithmetic number, because the mean of its divisors is an integer number (3560875110).
Almost surely, 214006108707 is an apocalyptic number.
14006108707 is a deficient number, since it is larger than the sum of its proper divisors (237391733).
14006108707 is an equidigital number, since it uses as much as digits as its factorization.
14006108707 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237391732.
The product of its (nonzero) digits is 9408, while the sum is 34.
Adding to 14006108707 its reverse (70780160041), we get a palindrome (84786268748).
The spelling of 14006108707 in words is "fourteen billion, six million, one hundred eight thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •