Base | Representation |
---|---|
bin | 11000000111101001… |
… | …10011001000000100 |
3 | 1020102102222010201111 |
4 | 30003310303020010 |
5 | 203004430340221 |
6 | 5540531334404 |
7 | 635614213414 |
oct | 140364631004 |
9 | 36372863644 |
10 | 12949074436 |
11 | 5545462311 |
12 | 2614751404 |
13 | 12b498122c |
14 | 8abab0644 |
15 | 50bc42be1 |
hex | 303d33204 |
12949074436 has 9 divisors (see below), whose sum is σ = 22661278549. Its totient is φ = 6474423424.
The previous prime is 12949074433. The next prime is 12949074469. The reversal of 12949074436 is 63447094921.
The square root of 12949074436 is 113794.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 102212100 + 12846862336 = 10110^2 + 113344^2 .
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12949074436.
It is not an unprimeable number, because it can be changed into a prime (12949074433) 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 2 ways as a sum of consecutive naturals, for example, 199140 + ... + 256036.
Almost surely, 212949074436 is an apocalyptic number.
12949074436 is the 113794-th square number.
It is an amenable number.
12949074436 is a deficient number, since it is larger than the sum of its proper divisors (9712204113).
12949074436 is an frugal number, since it uses more digits than its factorization.
12949074436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113798 (or 56899 counting only the distinct ones).
The product of its (nonzero) digits is 1306368, while the sum is 49.
Multiplying 12949074436 by its sum of digits (49), we get a square (634504647364 = 7965582).
The spelling of 12949074436 in words is "twelve billion, nine hundred forty-nine million, seventy-four thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •