Base | Representation |
---|---|
bin | 100001000111010… |
… | …1011011111101111 |
3 | 2212102210222121110 |
4 | 1002032223133233 |
5 | 4233423110211 |
6 | 302131403103 |
7 | 36351400065 |
oct | 10216533757 |
9 | 2772728543 |
10 | 1111144431 |
11 | 520237291 |
12 | 270153493 |
13 | 149283417 |
14 | a7800035 |
15 | 67837ea6 |
hex | 423ab7ef |
1111144431 has 16 divisors (see below), whose sum is σ = 1492909056. Its totient is φ = 735086016.
The previous prime is 1111144427. The next prime is 1111144451. The reversal of 1111144431 is 1344411111.
It is not a de Polignac number, because 1111144431 - 22 = 1111144427 is a prime.
It is a super-2 number, since 2×11111444312 = 2469283893084627522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1111144398 and 1111144407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111144451) 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 15 ways as a sum of consecutive naturals, for example, 420691 + ... + 423323.
It is an arithmetic number, because the mean of its divisors is an integer number (93306816).
Almost surely, 21111144431 is an apocalyptic number.
1111144431 is a deficient number, since it is larger than the sum of its proper divisors (381764625).
1111144431 is a wasteful number, since it uses less digits than its factorization.
1111144431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3662.
The product of its digits is 192, while the sum is 21.
The square root of 1111144431 is about 33333.8331279197. The cubic root of 1111144431 is about 1035.7545218120.
Adding to 1111144431 its reverse (1344411111), we get a palindrome (2455555542).
The spelling of 1111144431 in words is "one billion, one hundred eleven million, one hundred forty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •