Base | Representation |
---|---|
bin | 1001100110011111111110… |
… | …01010101001111011101001 |
3 | 2202202111001010010112211212 |
4 | 10303033333022221323221 |
5 | 10231413031040234423 |
6 | 112523354122002505 |
7 | 4306303503241034 |
oct | 463177712517351 |
9 | 82674033115755 |
10 | 21114045243113 |
11 | 6800464109069 |
12 | 2450063046435 |
13 | ba2079b7c044 |
14 | 52dcd4c1801b |
15 | 269358905578 |
hex | 1333ff2a9ee9 |
21114045243113 has 8 divisors (see below), whose sum is σ = 21406397895168. Its totient is φ = 20821776892704.
The previous prime is 21114045243101. The next prime is 21114045243191. The reversal of 21114045243113 is 31134254041112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21114045243113 - 230 = 21112971501289 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 21114045243113.
It is not an unprimeable number, because it can be changed into a prime (21114045243713) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20570945 + ... + 21572942.
It is an arithmetic number, because the mean of its divisors is an integer number (2675799736896).
Almost surely, 221114045243113 is an apocalyptic number.
It is an amenable number.
21114045243113 is a deficient number, since it is larger than the sum of its proper divisors (292352652055).
21114045243113 is an equidigital number, since it uses as much as digits as its factorization.
21114045243113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42150823.
The product of its (nonzero) digits is 11520, while the sum is 32.
Adding to 21114045243113 its reverse (31134254041112), we get a palindrome (52248299284225).
The spelling of 21114045243113 in words is "twenty-one trillion, one hundred fourteen billion, forty-five million, two hundred forty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.343 sec. • engine limits •