Base | Representation |
---|---|
bin | 10100110000011111… |
… | …10010011100110111 |
3 | 1001202122210112111002 |
4 | 22120033302130313 |
5 | 140310404211411 |
6 | 5041455033515 |
7 | 543110136560 |
oct | 123017623467 |
9 | 31678715432 |
10 | 11144210231 |
11 | 47a9686100 |
12 | 21b020b89b |
13 | 1087a7a14b |
14 | 77a0cd167 |
15 | 45357833b |
hex | 2983f2737 |
11144210231 has 24 divisors (see below), whose sum is σ = 14228901792. Its totient is φ = 8541403200.
The previous prime is 11144210173. The next prime is 11144210261. The reversal of 11144210231 is 13201244111.
It is not a de Polignac number, because 11144210231 - 26 = 11144210167 is a prime.
It is a super-2 number, since 2×111442102312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11144210261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 56180 + ... + 159513.
It is an arithmetic number, because the mean of its divisors is an integer number (592870908).
Almost surely, 211144210231 is an apocalyptic number.
11144210231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11144210231 is a deficient number, since it is larger than the sum of its proper divisors (3084691561).
11144210231 is a wasteful number, since it uses less digits than its factorization.
11144210231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215783 (or 215772 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 11144210231 its reverse (13201244111), we get a palindrome (24345454342).
The spelling of 11144210231 in words is "eleven billion, one hundred forty-four million, two hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •