Base | Representation |
---|---|
bin | 10000011101100100100… |
… | …101110111000000010001 |
3 | 11000010222201212210222001 |
4 | 100131210211313000101 |
5 | 122013312043420243 |
6 | 2223410122314001 |
7 | 144505530504001 |
oct | 20354445670021 |
9 | 4003881783861 |
10 | 1131264045073 |
11 | 3a6848074878 |
12 | 1632b6058901 |
13 | 828a6cc9a26 |
14 | 3ca79754001 |
15 | 1e660566a4d |
hex | 10764977011 |
1131264045073 has 2 divisors, whose sum is σ = 1131264045074. Its totient is φ = 1131264045072.
The previous prime is 1131264045071. The next prime is 1131264045173. The reversal of 1131264045073 is 3705404621311.
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., 832561352704 + 298702692369 = 912448^2 + 546537^2 .
It is a cyclic number.
It is not a de Polignac number, because 1131264045073 - 21 = 1131264045071 is a prime.
Together with 1131264045071, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1131264045071) 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, 565632022536 + 565632022537.
It is an arithmetic number, because the mean of its divisors is an integer number (565632022537).
Almost surely, 21131264045073 is an apocalyptic number.
It is an amenable number.
1131264045073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131264045073 is an equidigital number, since it uses as much as digits as its factorization.
1131264045073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 37.
Adding to 1131264045073 its reverse (3705404621311), we get a palindrome (4836668666384).
The spelling of 1131264045073 in words is "one trillion, one hundred thirty-one billion, two hundred sixty-four million, forty-five thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •