Base | Representation |
---|---|
bin | 1010011000111110001111… |
… | …1000100111100111010101 |
3 | 1111110010201001100200110102 |
4 | 2212033203320213213111 |
5 | 2444133120133413141 |
6 | 40144102243503445 |
7 | 2256236604633500 |
oct | 246174370474725 |
9 | 44403631320412 |
10 | 11424141310421 |
11 | 3704a50a41124 |
12 | 13460a9987b85 |
13 | 64b3a4407358 |
14 | 2b6d07a3a137 |
15 | 14c27c6a899b |
hex | a63e3e279d5 |
11424141310421 has 12 divisors (see below), whose sum is σ = 13302826427232. Its totient is φ = 9782159615928.
The previous prime is 11424141310363. The next prime is 11424141310481. The reversal of 11424141310421 is 12401314142411.
It is a de Polignac number, because none of the positive numbers 2k-11424141310421 is a prime.
It is a super-2 number, since 2×114241413104212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11424141310481) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 118540715 + ... + 118637048.
It is an arithmetic number, because the mean of its divisors is an integer number (1108568868936).
Almost surely, 211424141310421 is an apocalyptic number.
It is an amenable number.
11424141310421 is a deficient number, since it is larger than the sum of its proper divisors (1878685116811).
11424141310421 is an equidigital number, since it uses as much as digits as its factorization.
11424141310421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237178760 (or 237178753 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 29.
Adding to 11424141310421 its reverse (12401314142411), we get a palindrome (23825455452832).
The spelling of 11424141310421 in words is "eleven trillion, four hundred twenty-four billion, one hundred forty-one million, three hundred ten thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •