Base | Representation |
---|---|
bin | 101110101101011111010… |
… | …110010110100000000001 |
3 | 102100212102020220202000001 |
4 | 232231133112112200001 |
5 | 410042424201434321 |
6 | 10454343132000001 |
7 | 450624212031313 |
oct | 56553726264001 |
9 | 12325366822001 |
10 | 3209940264961 |
11 | 1028367662091 |
12 | 43a136600001 |
13 | 1a3908353061 |
14 | b150d22b7b3 |
15 | 587706c6c91 |
hex | 2eb5f596801 |
3209940264961 has 4 divisors (see below), whose sum is σ = 3213559138752. Its totient is φ = 3206321391172.
The previous prime is 3209940264833. The next prime is 3209940265009. The reversal of 3209940264961 is 1694620499023.
It is a happy number.
3209940264961 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3209940264961 - 27 = 3209940264833 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3209941264961) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1809435565 + ... + 1809437338.
It is an arithmetic number, because the mean of its divisors is an integer number (803389784688).
Almost surely, 23209940264961 is an apocalyptic number.
It is an amenable number.
3209940264961 is a deficient number, since it is larger than the sum of its proper divisors (3618873791).
3209940264961 is an equidigital number, since it uses as much as digits as its factorization.
3209940264961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3618873790.
The product of its (nonzero) digits is 5038848, while the sum is 55.
The spelling of 3209940264961 in words is "three trillion, two hundred nine billion, nine hundred forty million, two hundred sixty-four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •