Base | Representation |
---|---|
bin | 1010001100101111110111… |
… | …1100111011100110111101 |
3 | 1110201001121200002110110110 |
4 | 2203023331330323212331 |
5 | 2432213012031013010 |
6 | 35503410434500233 |
7 | 2235123322610205 |
oct | 243137574734675 |
9 | 43631550073413 |
10 | 11214125251005 |
11 | 363397a397276 |
12 | 1311457a34679 |
13 | 634644c97101 |
14 | 2aaaa3615405 |
15 | 146a89c53120 |
hex | a32fdf3b9bd |
11214125251005 has 16 divisors (see below), whose sum is σ = 17942799956544. Its totient is φ = 5980800282240.
The previous prime is 11214125251003. The next prime is 11214125251037. The reversal of 11214125251005 is 50015252141211.
It is not a de Polignac number, because 11214125251005 - 21 = 11214125251003 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11214125251003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2748336 + ... + 5475545.
It is an arithmetic number, because the mean of its divisors is an integer number (1121424997284).
Almost surely, 211214125251005 is an apocalyptic number.
11214125251005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11214125251005 is a deficient number, since it is larger than the sum of its proper divisors (6728674705539).
11214125251005 is an equidigital number, since it uses as much as digits as its factorization.
11214125251005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8314796.
The product of its (nonzero) digits is 4000, while the sum is 30.
Adding to 11214125251005 its reverse (50015252141211), we get a palindrome (61229377392216).
The spelling of 11214125251005 in words is "eleven trillion, two hundred fourteen billion, one hundred twenty-five million, two hundred fifty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •