Base | Representation |
---|---|
bin | 10101010011101010… |
… | …10110000000000001 |
3 | 1002112020000000102201 |
4 | 22221311112000001 |
5 | 141411423032331 |
6 | 5131035113201 |
7 | 553322113051 |
oct | 125165260001 |
9 | 32466000381 |
10 | 11439267841 |
11 | 4940194271 |
12 | 2272ba2801 |
13 | 1103c37451 |
14 | 7a7377561 |
15 | 46e40ca61 |
hex | 2a9d56001 |
11439267841 has 8 divisors (see below), whose sum is σ = 11629891304. Its totient is φ = 11248744320.
The previous prime is 11439267821. The next prime is 11439267883. The reversal of 11439267841 is 14876293411.
It can be written as a sum of positive squares in 4 ways, for example, as 822026241 + 10617241600 = 28671^2 + 103040^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 11439267841 - 213 = 11439259649 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11439267791 and 11439267800.
It is not an unprimeable number, because it can be changed into a prime (11439267821) 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, 226765 + ... + 272581.
It is an arithmetic number, because the mean of its divisors is an integer number (1453736413).
Almost surely, 211439267841 is an apocalyptic number.
It is an amenable number.
11439267841 is a deficient number, since it is larger than the sum of its proper divisors (190623463).
11439267841 is an equidigital number, since it uses as much as digits as its factorization.
11439267841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49971.
The product of its digits is 290304, while the sum is 46.
The spelling of 11439267841 in words is "eleven billion, four hundred thirty-nine million, two hundred sixty-seven thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •