Base | Representation |
---|---|
bin | 100001000111001… |
… | …0010110101001001 |
3 | 2212102121212000121 |
4 | 1002032102311021 |
5 | 4233411342101 |
6 | 302125303241 |
7 | 36350466406 |
oct | 10216226511 |
9 | 2772555017 |
10 | 1111043401 |
11 | 520178396 |
12 | 270104b21 |
13 | 149249440 |
14 | a77b52ad |
15 | 678180a1 |
hex | 42392d49 |
1111043401 has 8 divisors (see below), whose sum is σ = 1200596040. Its totient is φ = 1022074752.
The previous prime is 1111043393. The next prime is 1111043407. The reversal of 1111043401 is 1043401111.
It can be written as a sum of positive squares in 4 ways, for example, as 106090000 + 1004953401 = 10300^2 + 31701^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 1111043401 - 23 = 1111043393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1111043407) 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, 142036 + ... + 149653.
It is an arithmetic number, because the mean of its divisors is an integer number (150074505).
Almost surely, 21111043401 is an apocalyptic number.
It is an amenable number.
1111043401 is a deficient number, since it is larger than the sum of its proper divisors (89552639).
1111043401 is a wasteful number, since it uses less digits than its factorization.
1111043401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291995.
The product of its (nonzero) digits is 48, while the sum is 16.
The square root of 1111043401 is about 33332.3176661930. The cubic root of 1111043401 is about 1035.7231291181.
Adding to 1111043401 its reverse (1043401111), we get a palindrome (2154444512).
The spelling of 1111043401 in words is "one billion, one hundred eleven million, forty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •