Base | Representation |
---|---|
bin | 10110101111000000… |
… | …10011010000110111 |
3 | 1011111121210211012210 |
4 | 23113200103100313 |
5 | 144444102103133 |
6 | 5335050144503 |
7 | 611315032302 |
oct | 132740232067 |
9 | 34447724183 |
10 | 12205503543 |
11 | 51a3763512 |
12 | 2447722133 |
13 | 11c68c7b5c |
14 | 83b033b39 |
15 | 4b6815763 |
hex | 2d7813437 |
12205503543 has 8 divisors (see below), whose sum is σ = 16358326768. Its totient is φ = 8094841344.
The previous prime is 12205503539. The next prime is 12205503581. The reversal of 12205503543 is 34530550221.
12205503543 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12205503543 - 22 = 12205503539 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 12205503543.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12205503593) 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 7 ways as a sum of consecutive naturals, for example, 10539580 + ... + 10540737.
It is an arithmetic number, because the mean of its divisors is an integer number (2044790846).
Almost surely, 212205503543 is an apocalyptic number.
12205503543 is a deficient number, since it is larger than the sum of its proper divisors (4152823225).
12205503543 is a wasteful number, since it uses less digits than its factorization.
12205503543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21080513.
The product of its (nonzero) digits is 18000, while the sum is 30.
The spelling of 12205503543 in words is "twelve billion, two hundred five million, five hundred three thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •