Base | Representation |
---|---|
bin | 10110101110000101… |
… | …01101100011111001 |
3 | 1011111002012202011002 |
4 | 23113002231203321 |
5 | 144440110400222 |
6 | 5334212014345 |
7 | 611162065265 |
oct | 132702554371 |
9 | 34432182132 |
10 | 12197746937 |
11 | 519a3458a2 |
12 | 24450013b5 |
13 | 11c511044c |
14 | 839db50a5 |
15 | 4b5cd2392 |
hex | 2d70ad8f9 |
12197746937 has 4 divisors (see below), whose sum is σ = 12198043380. Its totient is φ = 12197450496.
The previous prime is 12197746933. The next prime is 12197746961. The reversal of 12197746937 is 73964779121.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 73964779121 = 16529 ⋅4474849.
It can be written as a sum of positive squares in 2 ways, for example, as 8460136441 + 3737610496 = 91979^2 + 61136^2 .
It is a cyclic number.
It is not a de Polignac number, because 12197746937 - 22 = 12197746933 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12197746933) 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 3 ways as a sum of consecutive naturals, for example, 74168 + ... + 172905.
It is an arithmetic number, because the mean of its divisors is an integer number (3049510845).
Almost surely, 212197746937 is an apocalyptic number.
It is an amenable number.
12197746937 is a deficient number, since it is larger than the sum of its proper divisors (296443).
12197746937 is an equidigital number, since it uses as much as digits as its factorization.
12197746937 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296442.
The product of its digits is 4000752, while the sum is 56.
The spelling of 12197746937 in words is "twelve billion, one hundred ninety-seven million, seven hundred forty-six thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •