Base | Representation |
---|---|
bin | 100000000011001… |
… | …1101101001011001 |
3 | 2202221121211000110 |
4 | 1000012131221121 |
5 | 4200302423441 |
6 | 254414154533 |
7 | 35436025164 |
oct | 10006355131 |
9 | 2687554013 |
10 | 1075436121 |
11 | 502068091 |
12 | 2601b2a49 |
13 | 141a60146 |
14 | a2b86adb |
15 | 64632b16 |
hex | 4019da59 |
1075436121 has 4 divisors (see below), whose sum is σ = 1433914832. Its totient is φ = 716957412.
The previous prime is 1075436113. The next prime is 1075436123. The reversal of 1075436121 is 1216345701.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1216345701 = 3 ⋅405448567.
It is not a de Polignac number, because 1075436121 - 23 = 1075436113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1075436123) 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 3 ways as a sum of consecutive naturals, for example, 179239351 + ... + 179239356.
It is an arithmetic number, because the mean of its divisors is an integer number (358478708).
Almost surely, 21075436121 is an apocalyptic number.
It is an amenable number.
1075436121 is a deficient number, since it is larger than the sum of its proper divisors (358478711).
1075436121 is an equidigital number, since it uses as much as digits as its factorization.
1075436121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 358478710.
The product of its (nonzero) digits is 5040, while the sum is 30.
The square root of 1075436121 is about 32793.8427300004. The cubic root of 1075436121 is about 1024.5383194656.
The spelling of 1075436121 in words is "one billion, seventy-five million, four hundred thirty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •