Base | Representation |
---|---|
bin | 10110011000001110… |
… | …00111000100101101 |
3 | 1011000022010020201112 |
4 | 23030013013010231 |
5 | 144101133210022 |
6 | 5304101121405 |
7 | 603504203222 |
oct | 131407070455 |
9 | 34008106645 |
10 | 12014350637 |
11 | 5105873503 |
12 | 23b36b9265 |
13 | 119611a723 |
14 | 81d8b5949 |
15 | 4a4b578e2 |
hex | 2cc1c712d |
12014350637 has 4 divisors (see below), whose sum is σ = 12428638620. Its totient is φ = 11600062656.
The previous prime is 12014350591. The next prime is 12014350651. The reversal of 12014350637 is 73605341021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 73605341021 = 143593 ⋅512597.
It can be written as a sum of positive squares in 2 ways, for example, as 3540964036 + 8473386601 = 59506^2 + 92051^2 .
It is a cyclic number.
It is not a de Polignac number, because 12014350637 - 214 = 12014334253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12014370637) 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, 207143948 + ... + 207144005.
It is an arithmetic number, because the mean of its divisors is an integer number (3107159655).
Almost surely, 212014350637 is an apocalyptic number.
It is an amenable number.
12014350637 is a deficient number, since it is larger than the sum of its proper divisors (414287983).
12014350637 is an equidigital number, since it uses as much as digits as its factorization.
12014350637 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 414287982.
The product of its (nonzero) digits is 15120, while the sum is 32.
Adding to 12014350637 its reverse (73605341021), we get a palindrome (85619691658).
The spelling of 12014350637 in words is "twelve billion, fourteen million, three hundred fifty thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •