Base | Representation |
---|---|
bin | 100001000111010… |
… | …1011011111111101 |
3 | 2212102210222121222 |
4 | 1002032223133331 |
5 | 4233423110240 |
6 | 302131403125 |
7 | 36351400115 |
oct | 10216533775 |
9 | 2772728558 |
10 | 1111144445 |
11 | 5202372a4 |
12 | 2701534a5 |
13 | 149283428 |
14 | a7800045 |
15 | 67837eb5 |
hex | 423ab7fd |
1111144445 has 8 divisors (see below), whose sum is σ = 1334328120. Its totient is φ = 888279040.
The previous prime is 1111144427. The next prime is 1111144451. The reversal of 1111144445 is 5444411111.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 33860761 + 1077283684 = 5819^2 + 32822^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1111144445 - 28 = 1111144189 is a prime.
It is a plaindrome in base 10.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 71816 + ... + 85905.
It is an arithmetic number, because the mean of its divisors is an integer number (166791015).
Almost surely, 21111144445 is an apocalyptic number.
It is an amenable number.
1111144445 is a deficient number, since it is larger than the sum of its proper divisors (223183675).
1111144445 is a wasteful number, since it uses less digits than its factorization.
1111144445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159135.
The product of its digits is 1280, while the sum is 26.
The square root of 1111144445 is about 33333.8333379166. The cubic root of 1111144445 is about 1035.7545261620.
Adding to 1111144445 its reverse (5444411111), we get a palindrome (6555555556).
The spelling of 1111144445 in words is "one billion, one hundred eleven million, one hundred forty-four thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •