Base | Representation |
---|---|
bin | 1010000100000010100100… |
… | …0000000010011100000101 |
3 | 1110011202110200020201022010 |
4 | 2201000221000002130011 |
5 | 2422240121022132331 |
6 | 35310545540524433 |
7 | 2221246132040556 |
oct | 241005100023405 |
9 | 43152420221263 |
10 | 11064523630341 |
11 | 3586490157445 |
12 | 12a84666b0719 |
13 | 6234c310c68c |
14 | 2a3750b2632d |
15 | 142c31116e46 |
hex | a1029002705 |
11064523630341 has 4 divisors (see below), whose sum is σ = 14752698173792. Its totient is φ = 7376349086892.
The previous prime is 11064523630319. The next prime is 11064523630343. The reversal of 11064523630341 is 14303632546011.
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 not a de Polignac number, because 11064523630341 - 25 = 11064523630309 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 11064523630341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11064523630343) 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, 1844087271721 + ... + 1844087271726.
It is an arithmetic number, because the mean of its divisors is an integer number (3688174543448).
Almost surely, 211064523630341 is an apocalyptic number.
It is an amenable number.
11064523630341 is a deficient number, since it is larger than the sum of its proper divisors (3688174543451).
11064523630341 is an equidigital number, since it uses as much as digits as its factorization.
11064523630341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3688174543450.
The product of its (nonzero) digits is 155520, while the sum is 39.
The spelling of 11064523630341 in words is "eleven trillion, sixty-four billion, five hundred twenty-three million, six hundred thirty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •