Base | Representation |
---|---|
bin | 10000111000100011001… |
… | …111011100011010001001 |
3 | 11002220202120222210011012 |
4 | 100320203033130122021 |
5 | 123002123444433001 |
6 | 2245000423213305 |
7 | 146552432600333 |
oct | 20704317343211 |
9 | 4086676883135 |
10 | 1160232421001 |
11 | 408062a55425 |
12 | 168a3b5a7235 |
13 | 85542731684 |
14 | 40226b7c453 |
15 | 202a88142bb |
hex | 10e233dc689 |
1160232421001 has 2 divisors, whose sum is σ = 1160232421002. Its totient is φ = 1160232421000.
The previous prime is 1160232420989. The next prime is 1160232421039. The reversal of 1160232421001 is 1001242320611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 891747816976 + 268484604025 = 944324^2 + 518155^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1160232421001 is a prime.
It is a super-2 number, since 2×11602324210012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1160232421091) 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 as a sum of consecutive naturals, namely, 580116210500 + 580116210501.
It is an arithmetic number, because the mean of its divisors is an integer number (580116210501).
Almost surely, 21160232421001 is an apocalyptic number.
It is an amenable number.
1160232421001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1160232421001 is an equidigital number, since it uses as much as digits as its factorization.
1160232421001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1160232421001 its reverse (1001242320611), we get a palindrome (2161474741612).
The spelling of 1160232421001 in words is "one trillion, one hundred sixty billion, two hundred thirty-two million, four hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •