Base | Representation |
---|---|
bin | 1011101000011111111001… |
… | …1101111001110110011110 |
3 | 1200021202020001110100222002 |
4 | 2322013332131321312132 |
5 | 3134024203021022230 |
6 | 43111453404122302 |
7 | 2460034465522115 |
oct | 272077635716636 |
9 | 50252201410862 |
10 | 12790386892190 |
11 | 4091410a573a6 |
12 | 1526a42836392 |
13 | 71a188b8108b |
14 | 3230b5332c7c |
15 | 172a922c9545 |
hex | ba1fe779d9e |
12790386892190 has 8 divisors (see below), whose sum is σ = 23022696405960. Its totient is φ = 5116154756872.
The previous prime is 12790386892169. The next prime is 12790386892193. The reversal of 12790386892190 is 9129868309721.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×127903868921902 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12790386892193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 639519344600 + ... + 639519344619.
It is an arithmetic number, because the mean of its divisors is an integer number (2877837050745).
Almost surely, 212790386892190 is an apocalyptic number.
12790386892190 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12790386892190 is a deficient number, since it is larger than the sum of its proper divisors (10232309513770).
12790386892190 is a wasteful number, since it uses less digits than its factorization.
12790386892190 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1279038689226.
The product of its (nonzero) digits is 23514624, while the sum is 65.
The spelling of 12790386892190 in words is "twelve trillion, seven hundred ninety billion, three hundred eighty-six million, eight hundred ninety-two thousand, one hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •