Base | Representation |
---|---|
bin | 100001111011011… |
… | …1010110101100001 |
3 | 2221100020021120111 |
4 | 1003312322311201 |
5 | 4312422021431 |
6 | 304545211321 |
7 | 40132560136 |
oct | 10366726541 |
9 | 2840207514 |
10 | 1138470241 |
11 | 5347005a7 |
12 | 279330b41 |
13 | 151b3013c |
14 | ab2b458d |
15 | 69e347b1 |
hex | 43dbad61 |
1138470241 has 4 divisors (see below), whose sum is σ = 1138965184. Its totient is φ = 1137975300.
The previous prime is 1138470217. The next prime is 1138470301. The reversal of 1138470241 is 1420748311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1138470241 - 25 = 1138470209 is a prime.
It is a super-2 number, since 2×11384702412 = 2592228979285196162, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1138470341) 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 3 ways as a sum of consecutive naturals, for example, 244005 + ... + 248626.
It is an arithmetic number, because the mean of its divisors is an integer number (284741296).
Almost surely, 21138470241 is an apocalyptic number.
It is an amenable number.
1138470241 is a deficient number, since it is larger than the sum of its proper divisors (494943).
1138470241 is an equidigital number, since it uses as much as digits as its factorization.
1138470241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 494942.
The product of its (nonzero) digits is 5376, while the sum is 31.
The square root of 1138470241 is about 33741.2246517520. The cubic root of 1138470241 is about 1044.1764505684.
The spelling of 1138470241 in words is "one billion, one hundred thirty-eight million, four hundred seventy thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •