Base | Representation |
---|---|
bin | 1001001001000111000110… |
… | …00100110011100111111111 |
3 | 2122011221121012201020010020 |
4 | 10210203203010303213333 |
5 | 10113342004144231333 |
6 | 110431433515343223 |
7 | 4143325135544061 |
oct | 444434304634777 |
9 | 78157535636106 |
10 | 20104256633343 |
11 | 6451192830833 |
12 | 230840aa51b13 |
13 | b2aa9193a91c |
14 | 4d70a0757731 |
15 | 24ce57b3a3b3 |
hex | 1248e31339ff |
20104256633343 has 4 divisors (see below), whose sum is σ = 26805675511128. Its totient is φ = 13402837755560.
The previous prime is 20104256633323. The next prime is 20104256633371. The reversal of 20104256633343 is 34333665240102.
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 20104256633343 - 232 = 20099961666047 is a prime.
It is a super-2 number, since 2×201042566333432 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20104256633295 and 20104256633304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20104256633323) 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, 3350709438888 + ... + 3350709438893.
It is an arithmetic number, because the mean of its divisors is an integer number (6701418877782).
Almost surely, 220104256633343 is an apocalyptic number.
20104256633343 is a deficient number, since it is larger than the sum of its proper divisors (6701418877785).
20104256633343 is an equidigital number, since it uses as much as digits as its factorization.
20104256633343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6701418877784.
The product of its (nonzero) digits is 933120, while the sum is 42.
The spelling of 20104256633343 in words is "twenty trillion, one hundred four billion, two hundred fifty-six million, six hundred thirty-three thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •