Base | Representation |
---|---|
bin | 10101010100001110… |
… | …11010010111010001 |
3 | 1002112112220122122022 |
4 | 22222013122113101 |
5 | 141414131114210 |
6 | 5131324421225 |
7 | 553410301016 |
oct | 125207322721 |
9 | 32475818568 |
10 | 11444004305 |
11 | 49429298a8 |
12 | 22746a7815 |
13 | 1104c052a6 |
14 | 7a7c4b70d |
15 | 46ea46155 |
hex | 2aa1da5d1 |
11444004305 has 8 divisors (see below), whose sum is σ = 14052172992. Its totient is φ = 8942291568.
The previous prime is 11444004301. The next prime is 11444004311. The reversal of 11444004305 is 50340044411.
It is a happy number.
11444004305 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11444004305 - 22 = 11444004301 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11444004301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26613749 + ... + 26614178.
It is an arithmetic number, because the mean of its divisors is an integer number (1756521624).
Almost surely, 211444004305 is an apocalyptic number.
It is an amenable number.
11444004305 is a deficient number, since it is larger than the sum of its proper divisors (2608168687).
11444004305 is an equidigital number, since it uses as much as digits as its factorization.
11444004305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53227975.
The product of its (nonzero) digits is 3840, while the sum is 26.
Adding to 11444004305 its reverse (50340044411), we get a palindrome (61784048716).
The spelling of 11444004305 in words is "eleven billion, four hundred forty-four million, four thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •