Base | Representation |
---|---|
bin | 11000000010101001… |
… | …01101001010100001 |
3 | 1020022111222222012011 |
4 | 30001110231022201 |
5 | 202413204410402 |
6 | 5532432032521 |
7 | 634564412332 |
oct | 140124551241 |
9 | 36274888164 |
10 | 12907106977 |
11 | 55237a8566 |
12 | 2602692741 |
13 | 12a907900b |
14 | 8a62a8289 |
15 | 508202ed7 |
hex | 30152d2a1 |
12907106977 has 4 divisors (see below), whose sum is σ = 12909379860. Its totient is φ = 12904834096.
The previous prime is 12907106963. The next prime is 12907106981. The reversal of 12907106977 is 77960170921.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6897136401 + 6009970576 = 83049^2 + 77524^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12907106977 is a prime.
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 12907106977.
It is not an unprimeable number, because it can be changed into a prime (12907106917) 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 3 ways as a sum of consecutive naturals, for example, 1127902 + ... + 1139287.
It is an arithmetic number, because the mean of its divisors is an integer number (3227344965).
Almost surely, 212907106977 is an apocalyptic number.
It is an amenable number.
12907106977 is a deficient number, since it is larger than the sum of its proper divisors (2272883).
12907106977 is an equidigital number, since it uses as much as digits as its factorization.
12907106977 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2272882.
The product of its (nonzero) digits is 333396, while the sum is 49.
The spelling of 12907106977 in words is "twelve billion, nine hundred seven million, one hundred six thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •