Base | Representation |
---|---|
bin | 10101010110010010… |
… | …00000111000100001 |
3 | 1002120202021100200021 |
4 | 22223021000320201 |
5 | 141433031421231 |
6 | 5133141153441 |
7 | 554006414314 |
oct | 125311007041 |
9 | 32522240607 |
10 | 11461201441 |
11 | 4951605308 |
12 | 227a3bb881 |
13 | 1108646a01 |
14 | 7aa24697b |
15 | 4712e1811 |
hex | 2ab240e21 |
11461201441 has 8 divisors (see below), whose sum is σ = 11515114760. Its totient is φ = 11407398912.
The previous prime is 11461201417. The next prime is 11461201463. The reversal of 11461201441 is 14410216411.
It can be written as a sum of positive squares in 4 ways, for example, as 628555041 + 10832646400 = 25071^2 + 104080^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11461201441 - 227 = 11326983713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11461201471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 183445 + ... + 237853.
It is an arithmetic number, because the mean of its divisors is an integer number (1439389345).
Almost surely, 211461201441 is an apocalyptic number.
It is an amenable number.
11461201441 is a deficient number, since it is larger than the sum of its proper divisors (53913319).
11461201441 is an equidigital number, since it uses as much as digits as its factorization.
11461201441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55395.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 11461201441 its reverse (14410216411), we get a palindrome (25871417852).
The spelling of 11461201441 in words is "eleven billion, four hundred sixty-one million, two hundred one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •