Base | Representation |
---|---|
bin | 10000011111100111111… |
… | …111001000111010101101 |
3 | 11000100200100221002020222 |
4 | 100133213333020322231 |
5 | 122032320413043331 |
6 | 2224412551221125 |
7 | 144614256114251 |
oct | 20374777107255 |
9 | 4010610832228 |
10 | 1133468487341 |
11 | 3a7779458993 |
12 | 1638103777a5 |
13 | 82b68925338 |
14 | 3cc0842a261 |
15 | 1e73dd5eb7b |
hex | 107e7fc8ead |
1133468487341 has 2 divisors, whose sum is σ = 1133468487342. Its totient is φ = 1133468487340.
The previous prime is 1133468487257. The next prime is 1133468487343. The reversal of 1133468487341 is 1437848643311.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 898791218116 + 234677269225 = 948046^2 + 484435^2 .
It is an emirp because it is prime and its reverse (1437848643311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1133468487341 - 226 = 1133401378477 is a prime.
Together with 1133468487343, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1133468487343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566734243670 + 566734243671.
It is an arithmetic number, because the mean of its divisors is an integer number (566734243671).
Almost surely, 21133468487341 is an apocalyptic number.
It is an amenable number.
1133468487341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1133468487341 is an equidigital number, since it uses as much as digits as its factorization.
1133468487341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4644864, while the sum is 53.
The spelling of 1133468487341 in words is "one trillion, one hundred thirty-three billion, four hundred sixty-eight million, four hundred eighty-seven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •