Base | Representation |
---|---|
bin | 110010000000100000100… |
… | …100011011001101010111 |
3 | 110011112021000010220000201 |
4 | 302000200210123031113 |
5 | 422300443141200333 |
6 | 11150414323321331 |
7 | 503165114133466 |
oct | 62004044331527 |
9 | 13145230126021 |
10 | 3436520256343 |
11 | 1105469105209 |
12 | 47602b820247 |
13 | 1bc0a7327185 |
14 | bc48545c9dd |
15 | 5e5d23b917d |
hex | 3202091b357 |
3436520256343 has 4 divisors (see below), whose sum is σ = 3437677726560. Its totient is φ = 3435362786128.
The previous prime is 3436520256329. The next prime is 3436520256373.
3436520256343 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3436520256343 - 213 = 3436520248151 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3436520256293 and 3436520256302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3436520256313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 578730655 + ... + 578736592.
It is an arithmetic number, because the mean of its divisors is an integer number (859419431640).
Almost surely, 23436520256343 is an apocalyptic number.
3436520256343 is a deficient number, since it is larger than the sum of its proper divisors (1157470217).
3436520256343 is a wasteful number, since it uses less digits than its factorization.
3436520256343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1157470216.
The product of its (nonzero) digits is 4665600, while the sum is 46.
The spelling of 3436520256343 in words is "three trillion, four hundred thirty-six billion, five hundred twenty million, two hundred fifty-six thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •