Base | Representation |
---|---|
bin | 10110111100100011… |
… | …10100111100001101 |
3 | 1011210112122122121210 |
4 | 23132101310330031 |
5 | 200212200243322 |
6 | 5354230045033 |
7 | 614165021511 |
oct | 133621647415 |
9 | 34715578553 |
10 | 12319149837 |
11 | 5251925675 |
12 | 24797a9779 |
13 | 1214308a97 |
14 | 84c178141 |
15 | 4c17b370c |
hex | 2de474f0d |
12319149837 has 8 divisors (see below), whose sum is σ = 16775012736. Its totient is φ = 8038026752.
The previous prime is 12319149827. The next prime is 12319149847. The reversal of 12319149837 is 73894191321.
It is an interprime number because it is at equal distance from previous prime (12319149827) and next prime (12319149847).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12319149837 - 27 = 12319149709 is a prime.
It is a super-2 number, since 2×123191498372 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12319149827) 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, 43684788 + ... + 43685069.
It is an arithmetic number, because the mean of its divisors is an integer number (2096876592).
Almost surely, 212319149837 is an apocalyptic number.
It is an amenable number.
12319149837 is a deficient number, since it is larger than the sum of its proper divisors (4455862899).
12319149837 is an equidigital number, since it uses as much as digits as its factorization.
12319149837 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87369907.
The product of its digits is 326592, while the sum is 48.
The spelling of 12319149837 in words is "twelve billion, three hundred nineteen million, one hundred forty-nine thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •