Base | Representation |
---|---|
bin | 1010011000110011000100… |
… | …0001001000010110100000 |
3 | 1111102211221220122122200202 |
4 | 2212030301001020112200 |
5 | 2444110443421420000 |
6 | 40142444404204332 |
7 | 2256102335532023 |
oct | 246146101102640 |
9 | 44384856578622 |
10 | 11421140420000 |
11 | 37037510227a3 |
12 | 13455b09996a8 |
13 | 64b0167a074c |
14 | 2b6b012811ba |
15 | 14c153edadd5 |
hex | a63310485a0 |
11421140420000 has 60 divisors (see below), whose sum is σ = 28097718653466. Its totient is φ = 4568456160000.
The previous prime is 11421140419993. The next prime is 11421140420003. The reversal of 11421140420000 is 2404112411.
It can be written as a sum of positive squares in 5 ways, for example, as 137157641104 + 11283982778896 = 370348^2 + 3359164^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (11421140420003) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 285508511 + ... + 285548510.
Almost surely, 211421140420000 is an apocalyptic number.
11421140420000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11421140420000 is an abundant number, since it is smaller than the sum of its proper divisors (16676578233466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11421140420000 is an frugal number, since it uses more digits than its factorization.
11421140420000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 571057051 (or 571057028 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 11421140420000 its reverse (2404112411), we get a palindrome (11423544532411).
The spelling of 11421140420000 in words is "eleven trillion, four hundred twenty-one billion, one hundred forty million, four hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •