Base | Representation |
---|---|
bin | 10000011110010000100… |
… | …001001100110010111001 |
3 | 11000012220002122002000221 |
4 | 100132100201030302321 |
5 | 122021314230133423 |
6 | 2224011210300041 |
7 | 144533016630124 |
oct | 20362041146271 |
9 | 4005802562027 |
10 | 1132001021113 |
11 | 3a7096079886 |
12 | 163480a27621 |
13 | 829938b4421 |
14 | 3cb095953bb |
15 | 1e6a50dee5d |
hex | 1079084ccb9 |
1132001021113 has 2 divisors, whose sum is σ = 1132001021114. Its totient is φ = 1132001021112.
The previous prime is 1132001021111. The next prime is 1132001021209. The reversal of 1132001021113 is 3111201002311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1112659999929 + 19341021184 = 1054827^2 + 139072^2 .
It is a cyclic number.
It is not a de Polignac number, because 1132001021113 - 21 = 1132001021111 is a prime.
Together with 1132001021111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1132001021111) 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 as a sum of consecutive naturals, namely, 566000510556 + 566000510557.
It is an arithmetic number, because the mean of its divisors is an integer number (566000510557).
Almost surely, 21132001021113 is an apocalyptic number.
It is an amenable number.
1132001021113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132001021113 is an equidigital number, since it uses as much as digits as its factorization.
1132001021113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1132001021113 its reverse (3111201002311), we get a palindrome (4243202023424).
The spelling of 1132001021113 in words is "one trillion, one hundred thirty-two billion, one million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •