Base | Representation |
---|---|
bin | 11110010001000010011001… |
… | …011001110010110110010001 |
3 | 122110022101212002120220000011 |
4 | 132101002121121302312101 |
5 | 114421402241212113203 |
6 | 1151034522303154521 |
7 | 40016016260200333 |
oct | 3621023131626621 |
9 | 573271762526004 |
10 | 133112200113553 |
11 | 39460626810981 |
12 | 12b1a0525a5a41 |
13 | 593757135320b |
14 | 24c2944545453 |
15 | 105c84912576d |
hex | 791099672d91 |
133112200113553 has 2 divisors, whose sum is σ = 133112200113554. Its totient is φ = 133112200113552.
The previous prime is 133112200113551. The next prime is 133112200113577. The reversal of 133112200113553 is 355311002211331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94616727314769 + 38495472798784 = 9727113^2 + 6204472^2 .
It is a cyclic number.
It is not a de Polignac number, because 133112200113553 - 21 = 133112200113551 is a prime.
Together with 133112200113551, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (133112200113551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66556100056776 + 66556100056777.
It is an arithmetic number, because the mean of its divisors is an integer number (66556100056777).
Almost surely, 2133112200113553 is an apocalyptic number.
It is an amenable number.
133112200113553 is a deficient number, since it is larger than the sum of its proper divisors (1).
133112200113553 is an equidigital number, since it uses as much as digits as its factorization.
133112200113553 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8100, while the sum is 31.
Adding to 133112200113553 its reverse (355311002211331), we get a palindrome (488423202324884).
The spelling of 133112200113553 in words is "one hundred thirty-three trillion, one hundred twelve billion, two hundred million, one hundred thirteen thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •