Base | Representation |
---|---|
bin | 11011001110001001… |
… | …10001011010111001 |
3 | 1101201111012120222222 |
4 | 31213010301122321 |
5 | 214412214044022 |
6 | 10414053053425 |
7 | 1025103462656 |
oct | 154704613271 |
9 | 41644176888 |
10 | 14614206137 |
11 | 621a37a413 |
12 | 29ba327275 |
13 | 14bb93c96b |
14 | 9c8cbac2d |
15 | 5a800a242 |
hex | 3671316b9 |
14614206137 has 4 divisors (see below), whose sum is σ = 14954071440. Its totient is φ = 14274340836.
The previous prime is 14614206109. The next prime is 14614206151. The reversal of 14614206137 is 73160241641.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 73160241641 = 887 ⋅82480543.
It is a cyclic number.
It is not a de Polignac number, because 14614206137 - 214 = 14614189753 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14614206097 and 14614206106.
It is not an unprimeable number, because it can be changed into a prime (14614206037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 169932587 + ... + 169932672.
It is an arithmetic number, because the mean of its divisors is an integer number (3738517860).
Almost surely, 214614206137 is an apocalyptic number.
It is an amenable number.
14614206137 is a deficient number, since it is larger than the sum of its proper divisors (339865303).
14614206137 is an equidigital number, since it uses as much as digits as its factorization.
14614206137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 339865302.
The product of its (nonzero) digits is 24192, while the sum is 35.
Adding to 14614206137 its reverse (73160241641), we get a palindrome (87774447778).
The spelling of 14614206137 in words is "fourteen billion, six hundred fourteen million, two hundred six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •